 Home Metamath Proof ExplorerTheorem List (p. 327 of 424) < Previous  Next > Bad symbols? Try the GIF version. Mirrors  >  Metamath Home Page  >  MPE Home Page  >  Theorem List Contents  >  Recent Proofs       This page: Page List

 Color key: Metamath Proof Explorer (1-27159) Hilbert Space Explorer (27160-28684) Users' Mathboxes (28685-42360)

Theorem List for Metamath Proof Explorer - 32601-32700   *Has distinct variable group(s)
TypeLabelDescription
Statement

Theorempoimirlem22 32601* Lemma for poimir 32612, that a given face belongs to exactly two simplices, provided it's not on the boundary of the cube. (Contributed by Brendan Leahy, 21-Aug-2020.)
(𝜑𝑁 ∈ ℕ)    &   𝑆 = {𝑡 ∈ ((((0..^𝐾) ↑𝑚 (1...𝑁)) × {𝑓𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)) ∣ 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ if(𝑦 < (2nd𝑡), 𝑦, (𝑦 + 1)) / 𝑗((1st ‘(1st𝑡)) ∘𝑓 + ((((2nd ‘(1st𝑡)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))))}    &   (𝜑𝐹:(0...(𝑁 − 1))⟶((0...𝐾) ↑𝑚 (1...𝑁)))    &   (𝜑𝑇𝑆)    &   ((𝜑𝑛 ∈ (1...𝑁)) → ∃𝑝 ∈ ran 𝐹(𝑝𝑛) ≠ 0)    &   ((𝜑𝑛 ∈ (1...𝑁)) → ∃𝑝 ∈ ran 𝐹(𝑝𝑛) ≠ 𝐾)       (𝜑 → ∃!𝑧𝑆 𝑧𝑇)

Theorempoimirlem23 32602* Lemma for poimir 32612, two ways of expressing the property that a face is not on the back face of the cube. (Contributed by Brendan Leahy, 21-Aug-2020.)
(𝜑𝑁 ∈ ℕ)    &   (𝜑𝑇:(1...𝑁)⟶(0..^𝐾))    &   (𝜑𝑈:(1...𝑁)–1-1-onto→(1...𝑁))    &   (𝜑𝑉 ∈ (0...𝑁))       (𝜑 → (∃𝑝 ∈ ran (𝑦 ∈ (0...(𝑁 − 1)) ↦ if(𝑦 < 𝑉, 𝑦, (𝑦 + 1)) / 𝑗(𝑇𝑓 + (((𝑈 “ (1...𝑗)) × {1}) ∪ ((𝑈 “ ((𝑗 + 1)...𝑁)) × {0}))))(𝑝𝑁) ≠ 0 ↔ ¬ (𝑉 = 𝑁 ∧ ((𝑇𝑁) = 0 ∧ (𝑈𝑁) = 𝑁))))

Theorempoimirlem24 32603* Lemma for poimir 32612, two ways of expressing that a simplex has an admissible face on the back face of the cube. (Contributed by Brendan Leahy, 21-Aug-2020.)
(𝜑𝑁 ∈ ℕ)    &   (𝑝 = ((1st𝑠) ∘𝑓 + ((((2nd𝑠) “ (1...𝑗)) × {1}) ∪ (((2nd𝑠) “ ((𝑗 + 1)...𝑁)) × {0}))) → 𝐵 = 𝐶)    &   ((𝜑𝑝:(1...𝑁)⟶(0...𝐾)) → 𝐵 ∈ (0...𝑁))    &   (𝜑𝑇:(1...𝑁)⟶(0..^𝐾))    &   (𝜑𝑈:(1...𝑁)–1-1-onto→(1...𝑁))    &   (𝜑𝑉 ∈ (0...𝑁))       (𝜑 → (∃𝑥 ∈ (((0...𝐾) ↑𝑚 (1...𝑁)) ↑𝑚 (0...(𝑁 − 1)))(𝑥 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ if(𝑦 < 𝑉, 𝑦, (𝑦 + 1)) / 𝑗(𝑇𝑓 + (((𝑈 “ (1...𝑗)) × {1}) ∪ ((𝑈 “ ((𝑗 + 1)...𝑁)) × {0})))) ∧ ((0...(𝑁 − 1)) ⊆ ran (𝑝 ∈ ran 𝑥𝐵) ∧ ∃𝑝 ∈ ran 𝑥(𝑝𝑁) ≠ 0)) ↔ (∀𝑖 ∈ (0...(𝑁 − 1))∃𝑗 ∈ ((0...𝑁) ∖ {𝑉})𝑖 = 𝑇, 𝑈⟩ / 𝑠𝐶 ∧ ¬ (𝑉 = 𝑁 ∧ ((𝑇𝑁) = 0 ∧ (𝑈𝑁) = 𝑁)))))

Theorempoimirlem25 32604* Lemma for poimir 32612 stating that for a given simplex such that no vertex maps to 𝑁, the number of admissible faces is even. (Contributed by Brendan Leahy, 21-Aug-2020.)
(𝜑𝑁 ∈ ℕ)    &   (𝑝 = ((1st𝑠) ∘𝑓 + ((((2nd𝑠) “ (1...𝑗)) × {1}) ∪ (((2nd𝑠) “ ((𝑗 + 1)...𝑁)) × {0}))) → 𝐵 = 𝐶)    &   ((𝜑𝑝:(1...𝑁)⟶(0...𝐾)) → 𝐵 ∈ (0...𝑁))    &   (𝜑𝑇:(1...𝑁)⟶(0..^𝐾))    &   (𝜑𝑈:(1...𝑁)–1-1-onto→(1...𝑁))    &   ((𝜑𝑗 ∈ (0...𝑁)) → 𝑁𝑇, 𝑈⟩ / 𝑠𝐶)       (𝜑 → 2 ∥ (#‘{𝑦 ∈ (0...𝑁) ∣ ∀𝑖 ∈ (0...(𝑁 − 1))∃𝑗 ∈ ((0...𝑁) ∖ {𝑦})𝑖 = 𝑇, 𝑈⟩ / 𝑠𝐶}))

Theorempoimirlem26 32605* Lemma for poimir 32612 showing an even difference between the number of admissible faces and the number of admissible simplices. Equation (6) of [Kulpa] p. 548. (Contributed by Brendan Leahy, 21-Aug-2020.)
(𝜑𝑁 ∈ ℕ)    &   (𝑝 = ((1st𝑠) ∘𝑓 + ((((2nd𝑠) “ (1...𝑗)) × {1}) ∪ (((2nd𝑠) “ ((𝑗 + 1)...𝑁)) × {0}))) → 𝐵 = 𝐶)    &   ((𝜑𝑝:(1...𝑁)⟶(0...𝐾)) → 𝐵 ∈ (0...𝑁))       (𝜑 → 2 ∥ ((#‘{𝑡 ∈ ((((0..^𝐾) ↑𝑚 (1...𝑁)) × {𝑓𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)) ∣ ∀𝑖 ∈ (0...(𝑁 − 1))∃𝑗 ∈ ((0...𝑁) ∖ {(2nd𝑡)})𝑖 = (1st𝑡) / 𝑠𝐶}) − (#‘{𝑠 ∈ (((0..^𝐾) ↑𝑚 (1...𝑁)) × {𝑓𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) ∣ ∀𝑖 ∈ (0...𝑁)∃𝑗 ∈ (0...𝑁)𝑖 = 𝐶})))

Theorempoimirlem27 32606* Lemma for poimir 32612 showing that the difference between admissible faces in the whole cube and admissible faces on the back face is even. Equation (7) of [Kulpa] p. 548. (Contributed by Brendan Leahy, 21-Aug-2020.)
(𝜑𝑁 ∈ ℕ)    &   (𝑝 = ((1st𝑠) ∘𝑓 + ((((2nd𝑠) “ (1...𝑗)) × {1}) ∪ (((2nd𝑠) “ ((𝑗 + 1)...𝑁)) × {0}))) → 𝐵 = 𝐶)    &   ((𝜑𝑝:(1...𝑁)⟶(0...𝐾)) → 𝐵 ∈ (0...𝑁))    &   ((𝜑 ∧ (𝑛 ∈ (1...𝑁) ∧ 𝑝:(1...𝑁)⟶(0...𝐾) ∧ (𝑝𝑛) = 0)) → 𝐵 < 𝑛)    &   ((𝜑 ∧ (𝑛 ∈ (1...𝑁) ∧ 𝑝:(1...𝑁)⟶(0...𝐾) ∧ (𝑝𝑛) = 𝐾)) → 𝐵 ≠ (𝑛 − 1))       (𝜑 → 2 ∥ ((#‘{𝑡 ∈ ((((0..^𝐾) ↑𝑚 (1...𝑁)) × {𝑓𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)) ∣ ∀𝑖 ∈ (0...(𝑁 − 1))∃𝑗 ∈ ((0...𝑁) ∖ {(2nd𝑡)})𝑖 = (1st𝑡) / 𝑠𝐶}) − (#‘{𝑠 ∈ (((0..^𝐾) ↑𝑚 (1...𝑁)) × {𝑓𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) ∣ (∀𝑖 ∈ (0...(𝑁 − 1))∃𝑗 ∈ (0...(𝑁 − 1))𝑖 = 𝐶 ∧ ((1st𝑠)‘𝑁) = 0 ∧ ((2nd𝑠)‘𝑁) = 𝑁)})))

Theorempoimirlem28 32607* Lemma for poimir 32612, a variant of Sperner's lemma. (Contributed by Brendan Leahy, 21-Aug-2020.)
(𝜑𝑁 ∈ ℕ)    &   (𝑝 = ((1st𝑠) ∘𝑓 + ((((2nd𝑠) “ (1...𝑗)) × {1}) ∪ (((2nd𝑠) “ ((𝑗 + 1)...𝑁)) × {0}))) → 𝐵 = 𝐶)    &   ((𝜑𝑝:(1...𝑁)⟶(0...𝐾)) → 𝐵 ∈ (0...𝑁))    &   ((𝜑 ∧ (𝑛 ∈ (1...𝑁) ∧ 𝑝:(1...𝑁)⟶(0...𝐾) ∧ (𝑝𝑛) = 0)) → 𝐵 < 𝑛)    &   ((𝜑 ∧ (𝑛 ∈ (1...𝑁) ∧ 𝑝:(1...𝑁)⟶(0...𝐾) ∧ (𝑝𝑛) = 𝐾)) → 𝐵 ≠ (𝑛 − 1))    &   (𝜑𝐾 ∈ ℕ)       (𝜑 → ∃𝑠 ∈ (((0..^𝐾) ↑𝑚 (1...𝑁)) × {𝑓𝑓:(1...𝑁)–1-1-onto→(1...𝑁)})∀𝑖 ∈ (0...𝑁)∃𝑗 ∈ (0...𝑁)𝑖 = 𝐶)

Theorempoimirlem29 32608* Lemma for poimir 32612 connecting cubes of the tessellation to neighborhoods. (Contributed by Brendan Leahy, 21-Aug-2020.)
(𝜑𝑁 ∈ ℕ)    &   𝐼 = ((0[,]1) ↑𝑚 (1...𝑁))    &   𝑅 = (∏t‘((1...𝑁) × {(topGen‘ran (,))}))    &   (𝜑𝐹 ∈ ((𝑅t 𝐼) Cn 𝑅))    &   𝑋 = ((𝐹‘(((1st ‘(𝐺𝑘)) ∘𝑓 + ((((2nd ‘(𝐺𝑘)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(𝐺𝑘)) “ ((𝑗 + 1)...𝑁)) × {0}))) ∘𝑓 / ((1...𝑁) × {𝑘})))‘𝑛)    &   (𝜑𝐺:ℕ⟶((ℕ0𝑚 (1...𝑁)) × {𝑓𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}))    &   ((𝜑𝑘 ∈ ℕ) → ran (1st ‘(𝐺𝑘)) ⊆ (0..^𝑘))    &   ((𝜑 ∧ (𝑘 ∈ ℕ ∧ 𝑛 ∈ (1...𝑁) ∧ 𝑟 ∈ { ≤ , ≤ })) → ∃𝑗 ∈ (0...𝑁)0𝑟𝑋)       (𝜑 → (∀𝑖 ∈ ℕ ∃𝑘 ∈ (ℤ𝑖)∀𝑚 ∈ (1...𝑁)(((1st ‘(𝐺𝑘)) ∘𝑓 / ((1...𝑁) × {𝑘}))‘𝑚) ∈ ((𝐶𝑚)(ball‘((abs ∘ − ) ↾ (ℝ × ℝ)))(1 / 𝑖)) → ∀𝑛 ∈ (1...𝑁)∀𝑣 ∈ (𝑅t 𝐼)(𝐶𝑣 → ∀𝑟 ∈ { ≤ , ≤ }∃𝑧𝑣 0𝑟((𝐹𝑧)‘𝑛))))

Theorempoimirlem30 32609* Lemma for poimir 32612 combining poimirlem29 32608 with bwth 21023. (Contributed by Brendan Leahy, 21-Aug-2020.)
(𝜑𝑁 ∈ ℕ)    &   𝐼 = ((0[,]1) ↑𝑚 (1...𝑁))    &   𝑅 = (∏t‘((1...𝑁) × {(topGen‘ran (,))}))    &   (𝜑𝐹 ∈ ((𝑅t 𝐼) Cn 𝑅))    &   𝑋 = ((𝐹‘(((1st ‘(𝐺𝑘)) ∘𝑓 + ((((2nd ‘(𝐺𝑘)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(𝐺𝑘)) “ ((𝑗 + 1)...𝑁)) × {0}))) ∘𝑓 / ((1...𝑁) × {𝑘})))‘𝑛)    &   (𝜑𝐺:ℕ⟶((ℕ0𝑚 (1...𝑁)) × {𝑓𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}))    &   ((𝜑𝑘 ∈ ℕ) → ran (1st ‘(𝐺𝑘)) ⊆ (0..^𝑘))    &   ((𝜑 ∧ (𝑘 ∈ ℕ ∧ 𝑛 ∈ (1...𝑁) ∧ 𝑟 ∈ { ≤ , ≤ })) → ∃𝑗 ∈ (0...𝑁)0𝑟𝑋)       (𝜑 → ∃𝑐𝐼𝑛 ∈ (1...𝑁)∀𝑣 ∈ (𝑅t 𝐼)(𝑐𝑣 → ∀𝑟 ∈ { ≤ , ≤ }∃𝑧𝑣 0𝑟((𝐹𝑧)‘𝑛)))

Theorempoimirlem31 32610* Lemma for poimir 32612, assigning values to the vertices of the tessellation that meet the hypotheses of both poimirlem30 32609 and poimirlem28 32607. Equation (2) of [Kulpa] p. 547. (Contributed by Brendan Leahy, 21-Aug-2020.)
(𝜑𝑁 ∈ ℕ)    &   𝐼 = ((0[,]1) ↑𝑚 (1...𝑁))    &   𝑅 = (∏t‘((1...𝑁) × {(topGen‘ran (,))}))    &   (𝜑𝐹 ∈ ((𝑅t 𝐼) Cn 𝑅))    &   ((𝜑 ∧ (𝑛 ∈ (1...𝑁) ∧ 𝑧𝐼 ∧ (𝑧𝑛) = 0)) → ((𝐹𝑧)‘𝑛) ≤ 0)    &   𝑃 = ((1st ‘(𝐺𝑘)) ∘𝑓 + ((((2nd ‘(𝐺𝑘)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(𝐺𝑘)) “ ((𝑗 + 1)...𝑁)) × {0})))    &   (𝜑𝐺:ℕ⟶((ℕ0𝑚 (1...𝑁)) × {𝑓𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}))    &   ((𝜑𝑘 ∈ ℕ) → ran (1st ‘(𝐺𝑘)) ⊆ (0..^𝑘))    &   ((𝜑 ∧ (𝑘 ∈ ℕ ∧ 𝑖 ∈ (0...𝑁))) → ∃𝑗 ∈ (0...𝑁)𝑖 = sup(({0} ∪ {𝑎 ∈ (1...𝑁) ∣ ∀𝑏 ∈ (1...𝑎)(0 ≤ ((𝐹‘(𝑃𝑓 / ((1...𝑁) × {𝑘})))‘𝑏) ∧ (𝑃𝑏) ≠ 0)}), ℝ, < ))       ((𝜑 ∧ (𝑘 ∈ ℕ ∧ 𝑛 ∈ (1...𝑁) ∧ 𝑟 ∈ { ≤ , ≤ })) → ∃𝑗 ∈ (0...𝑁)0𝑟((𝐹‘(𝑃𝑓 / ((1...𝑁) × {𝑘})))‘𝑛))

Theorempoimirlem32 32611* Lemma for poimir 32612, combining poimirlem28 32607, poimirlem30 32609, and poimirlem31 32610 to get Equation (1) of [Kulpa] p. 547. (Contributed by Brendan Leahy, 21-Aug-2020.)
(𝜑𝑁 ∈ ℕ)    &   𝐼 = ((0[,]1) ↑𝑚 (1...𝑁))    &   𝑅 = (∏t‘((1...𝑁) × {(topGen‘ran (,))}))    &   (𝜑𝐹 ∈ ((𝑅t 𝐼) Cn 𝑅))    &   ((𝜑 ∧ (𝑛 ∈ (1...𝑁) ∧ 𝑧𝐼 ∧ (𝑧𝑛) = 0)) → ((𝐹𝑧)‘𝑛) ≤ 0)    &   ((𝜑 ∧ (𝑛 ∈ (1...𝑁) ∧ 𝑧𝐼 ∧ (𝑧𝑛) = 1)) → 0 ≤ ((𝐹𝑧)‘𝑛))       (𝜑 → ∃𝑐𝐼𝑛 ∈ (1...𝑁)∀𝑣 ∈ (𝑅t 𝐼)(𝑐𝑣 → ∀𝑟 ∈ { ≤ , ≤ }∃𝑧𝑣 0𝑟((𝐹𝑧)‘𝑛)))

Theorempoimir 32612* Poincare-Miranda theorem. Theorem on [Kulpa] p. 547. (Contributed by Brendan Leahy, 21-Aug-2020.)
(𝜑𝑁 ∈ ℕ)    &   𝐼 = ((0[,]1) ↑𝑚 (1...𝑁))    &   𝑅 = (∏t‘((1...𝑁) × {(topGen‘ran (,))}))    &   (𝜑𝐹 ∈ ((𝑅t 𝐼) Cn 𝑅))    &   ((𝜑 ∧ (𝑛 ∈ (1...𝑁) ∧ 𝑧𝐼 ∧ (𝑧𝑛) = 0)) → ((𝐹𝑧)‘𝑛) ≤ 0)    &   ((𝜑 ∧ (𝑛 ∈ (1...𝑁) ∧ 𝑧𝐼 ∧ (𝑧𝑛) = 1)) → 0 ≤ ((𝐹𝑧)‘𝑛))       (𝜑 → ∃𝑐𝐼 (𝐹𝑐) = ((1...𝑁) × {0}))

Theorembroucube 32613* Brouwer - or as Kulpa calls it, "Bohl-Brouwer" - fixed point theorem for the unit cube. Theorem on [Kulpa] p. 548. (Contributed by Brendan Leahy, 21-Aug-2020.)
(𝜑𝑁 ∈ ℕ)    &   𝐼 = ((0[,]1) ↑𝑚 (1...𝑁))    &   𝑅 = (∏t‘((1...𝑁) × {(topGen‘ran (,))}))    &   (𝜑𝐹 ∈ ((𝑅t 𝐼) Cn (𝑅t 𝐼)))       (𝜑 → ∃𝑐𝐼 𝑐 = (𝐹𝑐))

Theoremheicant 32614 Heine-Cantor theorem: a continuous mapping between metric spaces whose domain is compact is uniformly continuous. Theorem on [Rosenlicht] p. 80. (Contributed by Brendan Leahy, 13-Aug-2018.) (Proof shortened by AV, 27-Sep-2020.)
(𝜑𝐶 ∈ (∞Met‘𝑋))    &   (𝜑𝐷 ∈ (∞Met‘𝑌))    &   (𝜑 → (MetOpen‘𝐶) ∈ Comp)    &   (𝜑𝑋 ≠ ∅)    &   (𝜑𝑌 ≠ ∅)       (𝜑 → ((metUnif‘𝐶) Cnu(metUnif‘𝐷)) = ((MetOpen‘𝐶) Cn (MetOpen‘𝐷)))

Theoremopnmbllem0 32615* Lemma for ismblfin 32620; could also be used to shorten proof of opnmbllem 23175. (Contributed by Brendan Leahy, 13-Jul-2018.)
(𝐴 ∈ (topGen‘ran (,)) → ([,] “ {𝑧 ∈ ran (𝑥 ∈ ℤ, 𝑦 ∈ ℕ0 ↦ ⟨(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))⟩) ∣ ([,]‘𝑧) ⊆ 𝐴}) = 𝐴)

Theoremmblfinlem1 32616* Lemma for ismblfin 32620, ordering the sets of dyadic intervals that are antichains under subset and whose unions are contained entirely in 𝐴. (Contributed by Brendan Leahy, 13-Jul-2018.)
((𝐴 ∈ (topGen‘ran (,)) ∧ 𝐴 ≠ ∅) → ∃𝑓 𝑓:ℕ–1-1-onto→{𝑎 ∈ {𝑏 ∈ ran (𝑥 ∈ ℤ, 𝑦 ∈ ℕ0 ↦ ⟨(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))⟩) ∣ ([,]‘𝑏) ⊆ 𝐴} ∣ ∀𝑐 ∈ {𝑏 ∈ ran (𝑥 ∈ ℤ, 𝑦 ∈ ℕ0 ↦ ⟨(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))⟩) ∣ ([,]‘𝑏) ⊆ 𝐴} (([,]‘𝑎) ⊆ ([,]‘𝑐) → 𝑎 = 𝑐)})

Theoremmblfinlem2 32617* Lemma for ismblfin 32620, effectively one direction of the same fact for open sets, made necessary by Viaclovsky's slightly different defintion of outer measure. Note that unlike the main theorem, this holds for sets of infinite measure. (Contributed by Brendan Leahy, 21-Feb-2018.) (Revised by Brendan Leahy, 13-Jul-2018.)
((𝐴 ∈ (topGen‘ran (,)) ∧ 𝑀 ∈ ℝ ∧ 𝑀 < (vol*‘𝐴)) → ∃𝑠 ∈ (Clsd‘(topGen‘ran (,)))(𝑠𝐴𝑀 < (vol*‘𝑠)))

Theoremmblfinlem3 32618* The difference between two sets measurable by the criterion in ismblfin 32620 is itself measurable by the same. Corollary 0.3 of [Viaclovsky7] p. 3. (Contributed by Brendan Leahy, 25-Mar-2018.) (Revised by Brendan Leahy, 13-Jul-2018.)
(((𝐴 ⊆ ℝ ∧ (vol*‘𝐴) ∈ ℝ) ∧ (𝐵 ⊆ ℝ ∧ (vol*‘𝐵) ∈ ℝ) ∧ ((vol*‘𝐴) = sup({𝑦 ∣ ∃𝑏 ∈ (Clsd‘(topGen‘ran (,)))(𝑏𝐴𝑦 = (vol‘𝑏))}, ℝ, < ) ∧ (vol*‘𝐵) = sup({𝑦 ∣ ∃𝑏 ∈ (Clsd‘(topGen‘ran (,)))(𝑏𝐵𝑦 = (vol‘𝑏))}, ℝ, < ))) → sup({𝑦 ∣ ∃𝑏 ∈ (Clsd‘(topGen‘ran (,)))(𝑏 ⊆ (𝐴𝐵) ∧ 𝑦 = (vol‘𝑏))}, ℝ, < ) = (vol*‘(𝐴𝐵)))

Theoremmblfinlem4 32619* Backward direction of ismblfin 32620. (Contributed by Brendan Leahy, 28-Mar-2018.) (Revised by Brendan Leahy, 13-Jul-2018.)
(((𝐴 ⊆ ℝ ∧ (vol*‘𝐴) ∈ ℝ) ∧ 𝐴 ∈ dom vol) → (vol*‘𝐴) = sup({𝑦 ∣ ∃𝑏 ∈ (Clsd‘(topGen‘ran (,)))(𝑏𝐴𝑦 = (vol‘𝑏))}, ℝ, < ))

Theoremismblfin 32620* Measurability in terms of inner and outer measure. Proposition 7 of [Viaclovsky8] p. 3. (Contributed by Brendan Leahy, 4-Mar-2018.) (Revised by Brendan Leahy, 28-Mar-2018.)
((𝐴 ⊆ ℝ ∧ (vol*‘𝐴) ∈ ℝ) → (𝐴 ∈ dom vol ↔ (vol*‘𝐴) = sup({𝑦 ∣ ∃𝑏 ∈ (Clsd‘(topGen‘ran (,)))(𝑏𝐴𝑦 = (vol‘𝑏))}, ℝ, < )))

Theoremovoliunnfl 32621* ovoliun 23080 is incompatible with the Feferman-Levy model. (Contributed by Brendan Leahy, 21-Nov-2017.)
((𝑓 Fn ℕ ∧ ∀𝑛 ∈ ℕ ((𝑓𝑛) ⊆ ℝ ∧ (vol*‘(𝑓𝑛)) ∈ ℝ)) → (vol*‘ 𝑚 ∈ ℕ (𝑓𝑚)) ≤ sup(ran seq1( + , (𝑚 ∈ ℕ ↦ (vol*‘(𝑓𝑚)))), ℝ*, < ))       ((𝐴 ≼ ℕ ∧ ∀𝑥𝐴 𝑥 ≼ ℕ) → 𝐴 ≠ ℝ)

Theoremex-ovoliunnfl 32622* Demonstration of ovoliunnfl 32621. (Contributed by Brendan Leahy, 21-Nov-2017.)
((𝐴 ≼ ℕ ∧ ∀𝑥𝐴 𝑥 ≼ ℕ) → 𝐴 ≠ ℝ)

Theoremvoliunnfl 32623* voliun 23129 is incompatible with the Feferman-Levy model; in that model, therefore, the Lebesgue measure as we've defined it isn't actually a measure. (Contributed by Brendan Leahy, 16-Dec-2017.)
𝑆 = seq1( + , 𝐺)    &   𝐺 = (𝑛 ∈ ℕ ↦ (vol‘(𝑓𝑛)))    &   ((∀𝑛 ∈ ℕ ((𝑓𝑛) ∈ dom vol ∧ (vol‘(𝑓𝑛)) ∈ ℝ) ∧ Disj 𝑛 ∈ ℕ (𝑓𝑛)) → (vol‘ 𝑛 ∈ ℕ (𝑓𝑛)) = sup(ran 𝑆, ℝ*, < ))       ((𝐴 ≼ ℕ ∧ ∀𝑥𝐴 𝑥 ≼ ℕ) → 𝐴 ≠ ℝ)

Theoremvolsupnfl 32624* volsup 23131 is incompatible with the Feferman-Levy model. (Contributed by Brendan Leahy, 2-Jan-2018.)
((𝑓:ℕ⟶dom vol ∧ ∀𝑛 ∈ ℕ (𝑓𝑛) ⊆ (𝑓‘(𝑛 + 1))) → (vol‘ ran 𝑓) = sup((vol “ ran 𝑓), ℝ*, < ))       ((𝐴 ≼ ℕ ∧ ∀𝑥𝐴 𝑥 ≼ ℕ) → 𝐴 ≠ ℝ)

Theorem0mbf 32625 The empty function is measurable. (Contributed by Brendan Leahy, 28-Mar-2018.)
∅ ∈ MblFn

Theoremmbfresfi 32626* Measurability of a piecewise function across arbitrarily many subsets. (Contributed by Brendan Leahy, 31-Mar-2018.)
(𝜑𝐹:𝐴⟶ℂ)    &   (𝜑𝑆 ∈ Fin)    &   (𝜑 → ∀𝑠𝑆 (𝐹𝑠) ∈ MblFn)    &   (𝜑 𝑆 = 𝐴)       (𝜑𝐹 ∈ MblFn)

Theoremmbfposadd 32627* If the sum of two measurable functions is measurable, the sum of their nonnegative parts is measurable. (Contributed by Brendan Leahy, 2-Apr-2018.)
(𝜑 → (𝑥𝐴𝐵) ∈ MblFn)    &   ((𝜑𝑥𝐴) → 𝐵 ∈ ℝ)    &   (𝜑 → (𝑥𝐴𝐶) ∈ MblFn)    &   ((𝜑𝑥𝐴) → 𝐶 ∈ ℝ)    &   (𝜑 → (𝑥𝐴 ↦ (𝐵 + 𝐶)) ∈ MblFn)       (𝜑 → (𝑥𝐴 ↦ (if(0 ≤ 𝐵, 𝐵, 0) + if(0 ≤ 𝐶, 𝐶, 0))) ∈ MblFn)

Theoremcnambfre 32628 A real-valued, a.e. continuous function is measurable. (Contributed by Brendan Leahy, 4-Apr-2018.)
((𝐹:𝐴⟶ℝ ∧ 𝐴 ∈ dom vol ∧ (vol*‘(𝐴 ∖ (((((topGen‘ran (,)) ↾t 𝐴) CnP (topGen‘ran (,))) ∘ E ) “ {𝐹}))) = 0) → 𝐹 ∈ MblFn)

Theoremdvtanlem 32629 Lemma for dvtan 32630- the domain of the tangent is open. (Contributed by Brendan Leahy, 8-Aug-2018.) (Proof shortened by OpenAI, 3-Jul-2020.)
(cos “ (ℂ ∖ {0})) ∈ (TopOpen‘ℂfld)

Theoremdvtan 32630 Derivative of tangent. (Contributed by Brendan Leahy, 7-Aug-2018.)
(ℂ D tan) = (𝑥 ∈ dom tan ↦ ((cos‘𝑥)↑-2))

Theoremitg2addnclem 32631* An alternate expression for the 2 integral that includes an arbitrarily small but strictly positive "buffer zone" wherever the simple function is nonzero. (Contributed by Brendan Leahy, 10-Oct-2017.) (Revised by Brendan Leahy, 10-Mar-2018.)
𝐿 = {𝑥 ∣ ∃𝑔 ∈ dom ∫1(∃𝑦 ∈ ℝ+ (𝑧 ∈ ℝ ↦ if((𝑔𝑧) = 0, 0, ((𝑔𝑧) + 𝑦))) ∘𝑟𝐹𝑥 = (∫1𝑔))}       (𝐹:ℝ⟶(0[,]+∞) → (∫2𝐹) = sup(𝐿, ℝ*, < ))

Theoremitg2addnclem2 32632* Lemma for itg2addnc 32634. The function described is a simple function. (Contributed by Brendan Leahy, 29-Oct-2017.)
(𝜑𝐹 ∈ MblFn)    &   (𝜑𝐹:ℝ⟶(0[,)+∞))       (((𝜑 ∈ dom ∫1) ∧ 𝑣 ∈ ℝ+) → (𝑥 ∈ ℝ ↦ if(((((⌊‘((𝐹𝑥) / (𝑣 / 3))) − 1) · (𝑣 / 3)) ≤ (𝑥) ∧ (𝑥) ≠ 0), (((⌊‘((𝐹𝑥) / (𝑣 / 3))) − 1) · (𝑣 / 3)), (𝑥))) ∈ dom ∫1)

Theoremitg2addnclem3 32633* Lemma incomprehensible in isolation split off to shorten proof of itg2addnc 32634. (Contributed by Brendan Leahy, 11-Mar-2018.)
(𝜑𝐹 ∈ MblFn)    &   (𝜑𝐹:ℝ⟶(0[,)+∞))    &   (𝜑 → (∫2𝐹) ∈ ℝ)    &   (𝜑𝐺:ℝ⟶(0[,)+∞))    &   (𝜑 → (∫2𝐺) ∈ ℝ)       (𝜑 → (∃ ∈ dom ∫1(∃𝑦 ∈ ℝ+ (𝑧 ∈ ℝ ↦ if((𝑧) = 0, 0, ((𝑧) + 𝑦))) ∘𝑟 ≤ (𝐹𝑓 + 𝐺) ∧ 𝑠 = (∫1)) → ∃𝑡𝑢(∃𝑓 ∈ dom ∫1𝑔 ∈ dom ∫1((∃𝑐 ∈ ℝ+ (𝑧 ∈ ℝ ↦ if((𝑓𝑧) = 0, 0, ((𝑓𝑧) + 𝑐))) ∘𝑟𝐹𝑡 = (∫1𝑓)) ∧ (∃𝑑 ∈ ℝ+ (𝑧 ∈ ℝ ↦ if((𝑔𝑧) = 0, 0, ((𝑔𝑧) + 𝑑))) ∘𝑟𝐺𝑢 = (∫1𝑔))) ∧ 𝑠 = (𝑡 + 𝑢))))

Theoremitg2addnc 32634 Alternate proof of itg2add 23332 using the "buffer zone" definition from the first lemma, in which every simple function in the set is divided into to by dividing its buffer by a third and finding the largest allowable function locked to a grid laid out in increments of the new, smaller buffer up to the original simple function. The measurability of this function follows from that of the augend, and subtracting it from the original simple function yields another simple function by i1fsub 23281, which is allowable by the fact that the grid must have a mark between one third and two thirds the original buffer. This has two advantages over the current approach: first, eliminating ax-cc 9140, and second, weakening the measurability hypothesis to only the augend. (Contributed by Brendan Leahy, 31-Oct-2017.) (Revised by Brendan Leahy, 13-Mar-2018.)
(𝜑𝐹 ∈ MblFn)    &   (𝜑𝐹:ℝ⟶(0[,)+∞))    &   (𝜑 → (∫2𝐹) ∈ ℝ)    &   (𝜑𝐺:ℝ⟶(0[,)+∞))    &   (𝜑 → (∫2𝐺) ∈ ℝ)       (𝜑 → (∫2‘(𝐹𝑓 + 𝐺)) = ((∫2𝐹) + (∫2𝐺)))

Theoremitg2gt0cn 32635* itg2gt0 23333 holds on functions continuous on an open interval in the absence of ax-cc 9140. The fourth hypothesis is made unnecessary by the continuity hypothesis. (Contributed by Brendan Leahy, 16-Nov-2017.)
(𝜑𝑋 < 𝑌)    &   (𝜑𝐹:ℝ⟶(0[,)+∞))    &   ((𝜑𝑥 ∈ (𝑋(,)𝑌)) → 0 < (𝐹𝑥))    &   (𝜑 → (𝐹 ↾ (𝑋(,)𝑌)) ∈ ((𝑋(,)𝑌)–cn→ℂ))       (𝜑 → 0 < (∫2𝐹))

Theoremibladdnclem 32636* Lemma for ibladdnc 32637; cf ibladdlem 23392, whose fifth hypothesis is rendered unnecessary by the weakened hypotheses of itg2addnc 32634. (Contributed by Brendan Leahy, 31-Oct-2017.)
((𝜑𝑥𝐴) → 𝐵 ∈ ℝ)    &   ((𝜑𝑥𝐴) → 𝐶 ∈ ℝ)    &   ((𝜑𝑥𝐴) → 𝐷 = (𝐵 + 𝐶))    &   (𝜑 → (𝑥𝐴𝐵) ∈ MblFn)    &   (𝜑 → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0))) ∈ ℝ)    &   (𝜑 → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0))) ∈ ℝ)       (𝜑 → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ 𝐷), 𝐷, 0))) ∈ ℝ)

Theoremibladdnc 32637* Choice-free analogue of itgadd 23397. A measurability hypothesis is necessitated by the loss of mbfadd 23234; for large classes of functions, such as continuous functions, it should be relatively easy to show. (Contributed by Brendan Leahy, 1-Nov-2017.)
((𝜑𝑥𝐴) → 𝐵𝑉)    &   (𝜑 → (𝑥𝐴𝐵) ∈ 𝐿1)    &   ((𝜑𝑥𝐴) → 𝐶𝑉)    &   (𝜑 → (𝑥𝐴𝐶) ∈ 𝐿1)    &   (𝜑 → (𝑥𝐴 ↦ (𝐵 + 𝐶)) ∈ MblFn)       (𝜑 → (𝑥𝐴 ↦ (𝐵 + 𝐶)) ∈ 𝐿1)

((𝜑𝑥𝐴) → 𝐵𝑉)    &   (𝜑 → (𝑥𝐴𝐵) ∈ 𝐿1)    &   ((𝜑𝑥𝐴) → 𝐶𝑉)    &   (𝜑 → (𝑥𝐴𝐶) ∈ 𝐿1)    &   (𝜑 → (𝑥𝐴 ↦ (𝐵 + 𝐶)) ∈ MblFn)    &   ((𝜑𝑥𝐴) → 𝐵 ∈ ℝ)    &   ((𝜑𝑥𝐴) → 𝐶 ∈ ℝ)    &   ((𝜑𝑥𝐴) → 0 ≤ 𝐵)    &   ((𝜑𝑥𝐴) → 0 ≤ 𝐶)       (𝜑 → ∫𝐴(𝐵 + 𝐶) d𝑥 = (∫𝐴𝐵 d𝑥 + ∫𝐴𝐶 d𝑥))

Theoremitgaddnclem2 32639* Lemma for itgaddnc 32640; cf. itgaddlem2 23396. (Contributed by Brendan Leahy, 10-Nov-2017.) (Revised by Brendan Leahy, 3-Apr-2018.)
((𝜑𝑥𝐴) → 𝐵𝑉)    &   (𝜑 → (𝑥𝐴𝐵) ∈ 𝐿1)    &   ((𝜑𝑥𝐴) → 𝐶𝑉)    &   (𝜑 → (𝑥𝐴𝐶) ∈ 𝐿1)    &   (𝜑 → (𝑥𝐴 ↦ (𝐵 + 𝐶)) ∈ MblFn)    &   ((𝜑𝑥𝐴) → 𝐵 ∈ ℝ)    &   ((𝜑𝑥𝐴) → 𝐶 ∈ ℝ)       (𝜑 → ∫𝐴(𝐵 + 𝐶) d𝑥 = (∫𝐴𝐵 d𝑥 + ∫𝐴𝐶 d𝑥))

Theoremitgaddnc 32640* Choice-free analogue of itgadd 23397. (Contributed by Brendan Leahy, 11-Nov-2017.)
((𝜑𝑥𝐴) → 𝐵𝑉)    &   (𝜑 → (𝑥𝐴𝐵) ∈ 𝐿1)    &   ((𝜑𝑥𝐴) → 𝐶𝑉)    &   (𝜑 → (𝑥𝐴𝐶) ∈ 𝐿1)    &   (𝜑 → (𝑥𝐴 ↦ (𝐵 + 𝐶)) ∈ MblFn)       (𝜑 → ∫𝐴(𝐵 + 𝐶) d𝑥 = (∫𝐴𝐵 d𝑥 + ∫𝐴𝐶 d𝑥))

Theoremiblsubnc 32641* Choice-free analogue of iblsub 23394. (Contributed by Brendan Leahy, 11-Nov-2017.)
((𝜑𝑥𝐴) → 𝐵𝑉)    &   (𝜑 → (𝑥𝐴𝐵) ∈ 𝐿1)    &   ((𝜑𝑥𝐴) → 𝐶𝑉)    &   (𝜑 → (𝑥𝐴𝐶) ∈ 𝐿1)    &   (𝜑 → (𝑥𝐴 ↦ (𝐵𝐶)) ∈ MblFn)       (𝜑 → (𝑥𝐴 ↦ (𝐵𝐶)) ∈ 𝐿1)

Theoremitgsubnc 32642* Choice-free analogue of itgsub 23398. (Contributed by Brendan Leahy, 11-Nov-2017.)
((𝜑𝑥𝐴) → 𝐵𝑉)    &   (𝜑 → (𝑥𝐴𝐵) ∈ 𝐿1)    &   ((𝜑𝑥𝐴) → 𝐶𝑉)    &   (𝜑 → (𝑥𝐴𝐶) ∈ 𝐿1)    &   (𝜑 → (𝑥𝐴 ↦ (𝐵𝐶)) ∈ MblFn)       (𝜑 → ∫𝐴(𝐵𝐶) d𝑥 = (∫𝐴𝐵 d𝑥 − ∫𝐴𝐶 d𝑥))

Theoremiblabsnclem 32643* Lemma for iblabsnc 32644; cf. iblabslem 23400. (Contributed by Brendan Leahy, 7-Nov-2017.)
((𝜑𝑥𝐴) → 𝐵𝑉)    &   (𝜑 → (𝑥𝐴𝐵) ∈ 𝐿1)    &   𝐺 = (𝑥 ∈ ℝ ↦ if(𝑥𝐴, (abs‘(𝐹𝐵)), 0))    &   (𝜑 → (𝑥𝐴 ↦ (𝐹𝐵)) ∈ 𝐿1)    &   ((𝜑𝑥𝐴) → (𝐹𝐵) ∈ ℝ)       (𝜑 → (𝐺 ∈ MblFn ∧ (∫2𝐺) ∈ ℝ))

Theoremiblabsnc 32644* Choice-free analogue of iblabs 23401. As with ibladdnc 32637, a measurability hypothesis is needed. (Contributed by Brendan Leahy, 7-Nov-2017.)
((𝜑𝑥𝐴) → 𝐵𝑉)    &   (𝜑 → (𝑥𝐴𝐵) ∈ 𝐿1)    &   (𝜑 → (𝑥𝐴 ↦ (abs‘𝐵)) ∈ MblFn)       (𝜑 → (𝑥𝐴 ↦ (abs‘𝐵)) ∈ 𝐿1)

Theoremiblmulc2nc 32645* Choice-free analogue of iblmulc2 23403. (Contributed by Brendan Leahy, 17-Nov-2017.)
(𝜑𝐶 ∈ ℂ)    &   ((𝜑𝑥𝐴) → 𝐵𝑉)    &   (𝜑 → (𝑥𝐴𝐵) ∈ 𝐿1)    &   (𝜑 → (𝑥𝐴 ↦ (𝐶 · 𝐵)) ∈ MblFn)       (𝜑 → (𝑥𝐴 ↦ (𝐶 · 𝐵)) ∈ 𝐿1)

Theoremitgmulc2nclem1 32646* Lemma for itgmulc2nc 32648; cf. itgmulc2lem1 23404. (Contributed by Brendan Leahy, 17-Nov-2017.)
(𝜑𝐶 ∈ ℂ)    &   ((𝜑𝑥𝐴) → 𝐵𝑉)    &   (𝜑 → (𝑥𝐴𝐵) ∈ 𝐿1)    &   (𝜑 → (𝑥𝐴 ↦ (𝐶 · 𝐵)) ∈ MblFn)    &   (𝜑𝐶 ∈ ℝ)    &   ((𝜑𝑥𝐴) → 𝐵 ∈ ℝ)    &   (𝜑 → 0 ≤ 𝐶)    &   ((𝜑𝑥𝐴) → 0 ≤ 𝐵)       (𝜑 → (𝐶 · ∫𝐴𝐵 d𝑥) = ∫𝐴(𝐶 · 𝐵) d𝑥)

Theoremitgmulc2nclem2 32647* Lemma for itgmulc2nc 32648; cf. itgmulc2lem2 23405. (Contributed by Brendan Leahy, 19-Nov-2017.)
(𝜑𝐶 ∈ ℂ)    &   ((𝜑𝑥𝐴) → 𝐵𝑉)    &   (𝜑 → (𝑥𝐴𝐵) ∈ 𝐿1)    &   (𝜑 → (𝑥𝐴 ↦ (𝐶 · 𝐵)) ∈ MblFn)    &   (𝜑𝐶 ∈ ℝ)    &   ((𝜑𝑥𝐴) → 𝐵 ∈ ℝ)       (𝜑 → (𝐶 · ∫𝐴𝐵 d𝑥) = ∫𝐴(𝐶 · 𝐵) d𝑥)

Theoremitgmulc2nc 32648* Choice-free analogue of itgmulc2 23406. (Contributed by Brendan Leahy, 19-Nov-2017.)
(𝜑𝐶 ∈ ℂ)    &   ((𝜑𝑥𝐴) → 𝐵𝑉)    &   (𝜑 → (𝑥𝐴𝐵) ∈ 𝐿1)    &   (𝜑 → (𝑥𝐴 ↦ (𝐶 · 𝐵)) ∈ MblFn)       (𝜑 → (𝐶 · ∫𝐴𝐵 d𝑥) = ∫𝐴(𝐶 · 𝐵) d𝑥)

Theoremitgabsnc 32649* Choice-free analogue of itgabs 23407. (Contributed by Brendan Leahy, 19-Nov-2017.) (Revised by Brendan Leahy, 19-Jun-2018.)
((𝜑𝑥𝐴) → 𝐵𝑉)    &   (𝜑 → (𝑥𝐴𝐵) ∈ 𝐿1)    &   (𝜑 → (𝑥𝐴 ↦ (abs‘𝐵)) ∈ MblFn)    &   (𝜑 → (𝑦𝐴 ↦ ((∗‘∫𝐴𝐵 d𝑥) · 𝑦 / 𝑥𝐵)) ∈ MblFn)       (𝜑 → (abs‘∫𝐴𝐵 d𝑥) ≤ ∫𝐴(abs‘𝐵) d𝑥)

Theorembddiblnc 32650* Choice-free proof of bddibl 23412. (Contributed by Brendan Leahy, 2-Nov-2017.) (Revised by Brendan Leahy, 6-Nov-2017.)
((𝐹 ∈ MblFn ∧ (vol‘dom 𝐹) ∈ ℝ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ dom 𝐹(abs‘(𝐹𝑦)) ≤ 𝑥) → 𝐹 ∈ 𝐿1)

Theoremcnicciblnc 32651 Choice-free proof of cniccibl 23413. (Contributed by Brendan Leahy, 2-Nov-2017.)
((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐹 ∈ ((𝐴[,]𝐵)–cn→ℂ)) → 𝐹 ∈ 𝐿1)

Theoremitggt0cn 32652* itggt0 23414 holds for continuous functions in the absence of ax-cc 9140. (Contributed by Brendan Leahy, 16-Nov-2017.)
(𝜑𝑋 < 𝑌)    &   (𝜑 → (𝑥 ∈ (𝑋(,)𝑌) ↦ 𝐵) ∈ 𝐿1)    &   ((𝜑𝑥 ∈ (𝑋(,)𝑌)) → 𝐵 ∈ ℝ+)    &   (𝜑 → (𝑥 ∈ (𝑋(,)𝑌) ↦ 𝐵) ∈ ((𝑋(,)𝑌)–cn→ℂ))       (𝜑 → 0 < ∫(𝑋(,)𝑌)𝐵 d𝑥)

Theoremftc1cnnclem 32653* Lemma for ftc1cnnc 32654; cf. ftc1lem4 23606. The stronger assumptions of ftc1cn 23610 are exploited to make use of weaker theorems. (Contributed by Brendan Leahy, 19-Nov-2017.)
𝐺 = (𝑥 ∈ (𝐴[,]𝐵) ↦ ∫(𝐴(,)𝑥)(𝐹𝑡) d𝑡)    &   (𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐴𝐵)    &   (𝜑𝐹 ∈ ((𝐴(,)𝐵)–cn→ℂ))    &   (𝜑𝐹 ∈ 𝐿1)    &   (𝜑𝑐 ∈ (𝐴(,)𝐵))    &   𝐻 = (𝑧 ∈ ((𝐴[,]𝐵) ∖ {𝑐}) ↦ (((𝐺𝑧) − (𝐺𝑐)) / (𝑧𝑐)))    &   (𝜑𝐸 ∈ ℝ+)    &   (𝜑𝑅 ∈ ℝ+)    &   ((𝜑𝑦 ∈ (𝐴(,)𝐵)) → ((abs‘(𝑦𝑐)) < 𝑅 → (abs‘((𝐹𝑦) − (𝐹𝑐))) < 𝐸))    &   (𝜑𝑋 ∈ (𝐴[,]𝐵))    &   (𝜑 → (abs‘(𝑋𝑐)) < 𝑅)    &   (𝜑𝑌 ∈ (𝐴[,]𝐵))    &   (𝜑 → (abs‘(𝑌𝑐)) < 𝑅)       ((𝜑𝑋 < 𝑌) → (abs‘((((𝐺𝑌) − (𝐺𝑋)) / (𝑌𝑋)) − (𝐹𝑐))) < 𝐸)

Theoremftc1cnnc 32654* Choice-free proof of ftc1cn 23610. (Contributed by Brendan Leahy, 20-Nov-2017.)
𝐺 = (𝑥 ∈ (𝐴[,]𝐵) ↦ ∫(𝐴(,)𝑥)(𝐹𝑡) d𝑡)    &   (𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐴𝐵)    &   (𝜑𝐹 ∈ ((𝐴(,)𝐵)–cn→ℂ))    &   (𝜑𝐹 ∈ 𝐿1)       (𝜑 → (ℝ D 𝐺) = 𝐹)

Theoremftc1anclem1 32655 Lemma for ftc1anc 32663- the absolute value of a real-valued measurable function is measurable. Would be trivial with cncombf 23231, but this proof avoids ax-cc 9140. (Contributed by Brendan Leahy, 18-Jun-2018.)
((𝐹:𝐴⟶ℝ ∧ 𝐹 ∈ MblFn) → (abs ∘ 𝐹) ∈ MblFn)

Theoremftc1anclem2 32656* Lemma for ftc1anc 32663- restriction of an integrable function to the absolute value of its real or imaginary part. (Contributed by Brendan Leahy, 19-Jun-2018.) (Revised by Brendan Leahy, 8-Aug-2018.)
((𝐹:𝐴⟶ℂ ∧ 𝐹 ∈ 𝐿1𝐺 ∈ {ℜ, ℑ}) → (∫2‘(𝑡 ∈ ℝ ↦ if(𝑡𝐴, (abs‘(𝐺‘(𝐹𝑡))), 0))) ∈ ℝ)

Theoremftc1anclem3 32657 Lemma for ftc1anc 32663- the absolute value of the sum of a simple function and i times another simple function is itself a simple function. (Contributed by Brendan Leahy, 27-May-2018.)
((𝐹 ∈ dom ∫1𝐺 ∈ dom ∫1) → (abs ∘ (𝐹𝑓 + ((ℝ × {i}) ∘𝑓 · 𝐺))) ∈ dom ∫1)

Theoremftc1anclem4 32658* Lemma for ftc1anc 32663. (Contributed by Brendan Leahy, 17-Jun-2018.)
((𝐹 ∈ dom ∫1𝐺 ∈ 𝐿1𝐺:ℝ⟶ℝ) → (∫2‘(𝑡 ∈ ℝ ↦ (abs‘((𝐺𝑡) − (𝐹𝑡))))) ∈ ℝ)

Theoremftc1anclem5 32659* Lemma for ftc1anc 32663, the existence of a simple function the integral of whose pointwise difference from the function is less than a given positive real. (Contributed by Brendan Leahy, 17-Jun-2018.)
𝐺 = (𝑥 ∈ (𝐴[,]𝐵) ↦ ∫(𝐴(,)𝑥)(𝐹𝑡) d𝑡)    &   (𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐴𝐵)    &   (𝜑 → (𝐴(,)𝐵) ⊆ 𝐷)    &   (𝜑𝐷 ⊆ ℝ)    &   (𝜑𝐹 ∈ 𝐿1)    &   (𝜑𝐹:𝐷⟶ℂ)       ((𝜑𝑌 ∈ ℝ+) → ∃𝑓 ∈ dom ∫1(∫2‘(𝑡 ∈ ℝ ↦ (abs‘((ℜ‘if(𝑡𝐷, (𝐹𝑡), 0)) − (𝑓𝑡))))) < 𝑌)

Theoremftc1anclem6 32660* Lemma for ftc1anc 32663- construction of simple functions within an arbitrary absolute distance of the given function. Similar to Lemma 565Ib of [Fremlin5] p. 218, but without Fremlin's additional step of converting the simple function into a continuous one, which is unnecessary to this lemma's use; also, two simple functions are used to allow for complex-valued 𝐹. (Contributed by Brendan Leahy, 31-May-2018.)
𝐺 = (𝑥 ∈ (𝐴[,]𝐵) ↦ ∫(𝐴(,)𝑥)(𝐹𝑡) d𝑡)    &   (𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐴𝐵)    &   (𝜑 → (𝐴(,)𝐵) ⊆ 𝐷)    &   (𝜑𝐷 ⊆ ℝ)    &   (𝜑𝐹 ∈ 𝐿1)    &   (𝜑𝐹:𝐷⟶ℂ)       ((𝜑𝑌 ∈ ℝ+) → ∃𝑓 ∈ dom ∫1𝑔 ∈ dom ∫1(∫2‘(𝑡 ∈ ℝ ↦ (abs‘(if(𝑡𝐷, (𝐹𝑡), 0) − ((𝑓𝑡) + (i · (𝑔𝑡))))))) < 𝑌)

Theoremftc1anclem7 32661* Lemma for ftc1anc 32663. (Contributed by Brendan Leahy, 13-May-2018.)
𝐺 = (𝑥 ∈ (𝐴[,]𝐵) ↦ ∫(𝐴(,)𝑥)(𝐹𝑡) d𝑡)    &   (𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐴𝐵)    &   (𝜑 → (𝐴(,)𝐵) ⊆ 𝐷)    &   (𝜑𝐷 ⊆ ℝ)    &   (𝜑𝐹 ∈ 𝐿1)    &   (𝜑𝐹:𝐷⟶ℂ)       (((((((𝜑 ∧ (𝑓 ∈ dom ∫1𝑔 ∈ dom ∫1)) ∧ (∫2‘(𝑡 ∈ ℝ ↦ (abs‘(if(𝑡𝐷, (𝐹𝑡), 0) − ((𝑓𝑡) + (i · (𝑔𝑡))))))) < (𝑦 / 2)) ∧ ∃𝑟 ∈ (ran 𝑓 ∪ ran 𝑔)𝑟 ≠ 0) ∧ 𝑦 ∈ ℝ+) ∧ (𝑢 ∈ (𝐴[,]𝐵) ∧ 𝑤 ∈ (𝐴[,]𝐵) ∧ 𝑢𝑤)) ∧ (abs‘(𝑤𝑢)) < ((𝑦 / 2) / (2 · sup((abs “ (ran 𝑓 ∪ ran 𝑔)), ℝ, < )))) → ((∫2‘(𝑡 ∈ ℝ ↦ if(𝑡 ∈ (𝑢(,)𝑤), (abs‘((𝑓𝑡) + (i · (𝑔𝑡)))), 0))) + (∫2‘(𝑡 ∈ ℝ ↦ if(𝑡 ∈ (𝑢(,)𝑤), (abs‘((𝐹𝑡) − ((𝑓𝑡) + (i · (𝑔𝑡))))), 0)))) < ((𝑦 / 2) + (𝑦 / 2)))

Theoremftc1anclem8 32662* Lemma for ftc1anc 32663. (Contributed by Brendan Leahy, 29-May-2018.)
𝐺 = (𝑥 ∈ (𝐴[,]𝐵) ↦ ∫(𝐴(,)𝑥)(𝐹𝑡) d𝑡)    &   (𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐴𝐵)    &   (𝜑 → (𝐴(,)𝐵) ⊆ 𝐷)    &   (𝜑𝐷 ⊆ ℝ)    &   (𝜑𝐹 ∈ 𝐿1)    &   (𝜑𝐹:𝐷⟶ℂ)       (((((((𝜑 ∧ (𝑓 ∈ dom ∫1𝑔 ∈ dom ∫1)) ∧ (∫2‘(𝑡 ∈ ℝ ↦ (abs‘(if(𝑡𝐷, (𝐹𝑡), 0) − ((𝑓𝑡) + (i · (𝑔𝑡))))))) < (𝑦 / 2)) ∧ ∃𝑟 ∈ (ran 𝑓 ∪ ran 𝑔)𝑟 ≠ 0) ∧ 𝑦 ∈ ℝ+) ∧ (𝑢 ∈ (𝐴[,]𝐵) ∧ 𝑤 ∈ (𝐴[,]𝐵) ∧ 𝑢𝑤)) ∧ (abs‘(𝑤𝑢)) < ((𝑦 / 2) / (2 · sup((abs “ (ran 𝑓 ∪ ran 𝑔)), ℝ, < )))) → (∫2‘(𝑡 ∈ ℝ ↦ if(𝑡 ∈ (𝑢(,)𝑤), ((abs‘((𝐹𝑡) − ((𝑓𝑡) + (i · (𝑔𝑡))))) + (abs‘((𝑓𝑡) + (i · (𝑔𝑡))))), 0))) < 𝑦)

Theoremftc1anc 32663* ftc1a 23604 holds for functions that obey the triangle inequality in the absence of ax-cc 9140. Theorem 565Ma of [Fremlin5] p. 220. (Contributed by Brendan Leahy, 11-May-2018.)
𝐺 = (𝑥 ∈ (𝐴[,]𝐵) ↦ ∫(𝐴(,)𝑥)(𝐹𝑡) d𝑡)    &   (𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐴𝐵)    &   (𝜑 → (𝐴(,)𝐵) ⊆ 𝐷)    &   (𝜑𝐷 ⊆ ℝ)    &   (𝜑𝐹 ∈ 𝐿1)    &   (𝜑𝐹:𝐷⟶ℂ)    &   (𝜑 → ∀𝑠 ∈ ((,) “ ((𝐴[,]𝐵) × (𝐴[,]𝐵)))(abs‘∫𝑠(𝐹𝑡) d𝑡) ≤ (∫2‘(𝑡 ∈ ℝ ↦ if(𝑡𝑠, (abs‘(𝐹𝑡)), 0))))       (𝜑𝐺 ∈ ((𝐴[,]𝐵)–cn→ℂ))

Theoremftc2nc 32664* Choice-free proof of ftc2 23611. (Contributed by Brendan Leahy, 19-Jun-2018.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐴𝐵)    &   (𝜑 → (ℝ D 𝐹) ∈ ((𝐴(,)𝐵)–cn→ℂ))    &   (𝜑 → (ℝ D 𝐹) ∈ 𝐿1)    &   (𝜑𝐹 ∈ ((𝐴[,]𝐵)–cn→ℂ))       (𝜑 → ∫(𝐴(,)𝐵)((ℝ D 𝐹)‘𝑡) d𝑡 = ((𝐹𝐵) − (𝐹𝐴)))

Theoremasindmre 32665 Real part of domain of differentiability of arcsine. (Contributed by Brendan Leahy, 19-Dec-2018.)
𝐷 = (ℂ ∖ ((-∞(,]-1) ∪ (1[,)+∞)))       (𝐷 ∩ ℝ) = (-1(,)1)

Theoremdvasin 32666* Derivative of arcsine. (Contributed by Brendan Leahy, 18-Dec-2018.)
𝐷 = (ℂ ∖ ((-∞(,]-1) ∪ (1[,)+∞)))       (ℂ D (arcsin ↾ 𝐷)) = (𝑥𝐷 ↦ (1 / (√‘(1 − (𝑥↑2)))))

Theoremdvacos 32667* Derivative of arccosine. (Contributed by Brendan Leahy, 18-Dec-2018.)
𝐷 = (ℂ ∖ ((-∞(,]-1) ∪ (1[,)+∞)))       (ℂ D (arccos ↾ 𝐷)) = (𝑥𝐷 ↦ (-1 / (√‘(1 − (𝑥↑2)))))

Theoremdvreasin 32668 Real derivative of arcsine. (Contributed by Brendan Leahy, 3-Aug-2017.) (Proof shortened by Brendan Leahy, 18-Dec-2018.)
(ℝ D (arcsin ↾ (-1(,)1))) = (𝑥 ∈ (-1(,)1) ↦ (1 / (√‘(1 − (𝑥↑2)))))

Theoremdvreacos 32669 Real derivative of arccosine. (Contributed by Brendan Leahy, 3-Aug-2017.) (Proof shortened by Brendan Leahy, 18-Dec-2018.)
(ℝ D (arccos ↾ (-1(,)1))) = (𝑥 ∈ (-1(,)1) ↦ (-1 / (√‘(1 − (𝑥↑2)))))

Theoremareacirclem1 32670* Antiderivative of cross-section of circle. (Contributed by Brendan Leahy, 28-Aug-2017.) (Revised by Brendan Leahy, 11-Jul-2018.)
(𝑅 ∈ ℝ+ → (ℝ D (𝑡 ∈ (-𝑅(,)𝑅) ↦ ((𝑅↑2) · ((arcsin‘(𝑡 / 𝑅)) + ((𝑡 / 𝑅) · (√‘(1 − ((𝑡 / 𝑅)↑2)))))))) = (𝑡 ∈ (-𝑅(,)𝑅) ↦ (2 · (√‘((𝑅↑2) − (𝑡↑2))))))

Theoremareacirclem2 32671* Endpoint-inclusive continuity of Cartesian ordinate of circle. (Contributed by Brendan Leahy, 29-Aug-2017.) (Revised by Brendan Leahy, 11-Jul-2018.)
((𝑅 ∈ ℝ ∧ 0 ≤ 𝑅) → (𝑡 ∈ (-𝑅[,]𝑅) ↦ (√‘((𝑅↑2) − (𝑡↑2)))) ∈ ((-𝑅[,]𝑅)–cn→ℂ))

Theoremareacirclem3 32672* Integrability of cross-section of circle. (Contributed by Brendan Leahy, 26-Aug-2017.) (Revised by Brendan Leahy, 11-Jul-2018.)
((𝑅 ∈ ℝ ∧ 0 ≤ 𝑅) → (𝑡 ∈ (-𝑅[,]𝑅) ↦ (2 · (√‘((𝑅↑2) − (𝑡↑2))))) ∈ 𝐿1)

Theoremareacirclem4 32673* Endpoint-inclusive continuity of antiderivative of cross-section of circle. (Contributed by Brendan Leahy, 31-Aug-2017.) (Revised by Brendan Leahy, 11-Jul-2018.)
(𝑅 ∈ ℝ+ → (𝑡 ∈ (-𝑅[,]𝑅) ↦ ((𝑅↑2) · ((arcsin‘(𝑡 / 𝑅)) + ((𝑡 / 𝑅) · (√‘(1 − ((𝑡 / 𝑅)↑2))))))) ∈ ((-𝑅[,]𝑅)–cn→ℂ))

Theoremareacirclem5 32674* Finding the cross-section of a circle. (Contributed by Brendan Leahy, 31-Aug-2017.) (Revised by Brendan Leahy, 22-Sep-2017.) (Revised by Brendan Leahy, 11-Jul-2018.)
𝑆 = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) ∧ ((𝑥↑2) + (𝑦↑2)) ≤ (𝑅↑2))}       ((𝑅 ∈ ℝ ∧ 0 ≤ 𝑅𝑡 ∈ ℝ) → (𝑆 “ {𝑡}) = if((abs‘𝑡) ≤ 𝑅, (-(√‘((𝑅↑2) − (𝑡↑2)))[,](√‘((𝑅↑2) − (𝑡↑2)))), ∅))

Theoremareacirc 32675* The area of a circle of radius 𝑅 is π · 𝑅↑2. This is Metamath 100 proof #9. (Contributed by Brendan Leahy, 31-Aug-2017.) (Revised by Brendan Leahy, 22-Sep-2017.) (Revised by Brendan Leahy, 11-Jul-2018.)
𝑆 = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) ∧ ((𝑥↑2) + (𝑦↑2)) ≤ (𝑅↑2))}       ((𝑅 ∈ ℝ ∧ 0 ≤ 𝑅) → (area‘𝑆) = (π · (𝑅↑2)))

21.19.1  Logic and set theory

Theoremanim12da 32676 Conjoin antecedents and consequents in a deduction. (Contributed by Jeff Madsen, 16-Jun-2011.)
((𝜑𝜓) → 𝜃)    &   ((𝜑𝜒) → 𝜏)       ((𝜑 ∧ (𝜓𝜒)) → (𝜃𝜏))

Theoremunirep 32677* Define a quantity whose definition involves a choice of representative, but which is uniquely determined regardless of the choice. (Contributed by Jeff Madsen, 1-Jun-2011.)
(𝑦 = 𝐷 → (𝜑𝜓))    &   (𝑦 = 𝐷𝐵 = 𝐶)    &   (𝑦 = 𝑧 → (𝜑𝜒))    &   (𝑦 = 𝑧𝐵 = 𝐹)    &   𝐵 ∈ V       ((∀𝑦𝐴𝑧𝐴 ((𝜑𝜒) → 𝐵 = 𝐹) ∧ (𝐷𝐴𝜓)) → (℩𝑥𝑦𝐴 (𝜑𝑥 = 𝐵)) = 𝐶)

Theoremcover2 32678* Two ways of expressing the statement "there is a cover of 𝐴 by elements of 𝐵 such that for each set in the cover, 𝜑." Note that 𝜑 and 𝑥 must be distinct. (Contributed by Jeff Madsen, 20-Jun-2010.)
𝐵 ∈ V    &   𝐴 = 𝐵       (∀𝑥𝐴𝑦𝐵 (𝑥𝑦𝜑) ↔ ∃𝑧 ∈ 𝒫 𝐵( 𝑧 = 𝐴 ∧ ∀𝑦𝑧 𝜑))

Theoremcover2g 32679* Two ways of expressing the statement "there is a cover of 𝐴 by elements of 𝐵 such that for each set in the cover, 𝜑." Note that 𝜑 and 𝑥 must be distinct. (Contributed by Jeff Madsen, 21-Jun-2010.)
𝐴 = 𝐵       (𝐵𝐶 → (∀𝑥𝐴𝑦𝐵 (𝑥𝑦𝜑) ↔ ∃𝑧 ∈ 𝒫 𝐵( 𝑧 = 𝐴 ∧ ∀𝑦𝑧 𝜑)))

Theorembrabg2 32680* Relation by a binary relation abstraction. (Contributed by Jeff Madsen, 2-Sep-2009.)
(𝑥 = 𝐴 → (𝜑𝜓))    &   (𝑦 = 𝐵 → (𝜓𝜒))    &   𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝜑}    &   (𝜒𝐴𝐶)       (𝐵𝐷 → (𝐴𝑅𝐵𝜒))

Theoremopelopab3 32681* Ordered pair membership in an ordered pair class abstraction, with a reduced hypothesis. (Contributed by Jeff Madsen, 29-May-2011.)
(𝑥 = 𝐴 → (𝜑𝜓))    &   (𝑦 = 𝐵 → (𝜓𝜒))    &   (𝜒𝐴𝐶)       (𝐵𝐷 → (⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ 𝜒))

Theoremcocanfo 32682 Cancellation of a surjective function from the right side of a composition. (Contributed by Jeff Madsen, 1-Jun-2011.) (Proof shortened by Mario Carneiro, 27-Dec-2014.)
(((𝐹:𝐴onto𝐵𝐺 Fn 𝐵𝐻 Fn 𝐵) ∧ (𝐺𝐹) = (𝐻𝐹)) → 𝐺 = 𝐻)

Theorembrresi 32683 Restriction of a binary relation. (Contributed by Jeff Madsen, 2-Sep-2009.)
𝐵 ∈ V       (𝐴(𝑅𝐶)𝐵𝐴𝑅𝐵)

Theoremfnopabeqd 32684* Equality deduction for function abstractions. (Contributed by Jeff Madsen, 19-Jun-2011.)
(𝜑𝐵 = 𝐶)       (𝜑 → {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐵)} = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐶)})

Theoremfvopabf4g 32685* Function value of an operator abstraction whose domain is a set of functions with given domain and range. (Contributed by Jeff Madsen, 1-Dec-2009.) (Revised by Mario Carneiro, 12-Sep-2015.)
𝐶 ∈ V    &   (𝑥 = 𝐴𝐵 = 𝐶)    &   𝐹 = (𝑥 ∈ (𝑅𝑚 𝐷) ↦ 𝐵)       ((𝐷𝑋𝑅𝑌𝐴:𝐷𝑅) → (𝐹𝐴) = 𝐶)

Theoremeqfnun 32686 Two functions on 𝐴𝐵 are equal if and only if they have equal restrictions to both 𝐴 and 𝐵. (Contributed by Jeff Madsen, 19-Jun-2011.)
((𝐹 Fn (𝐴𝐵) ∧ 𝐺 Fn (𝐴𝐵)) → (𝐹 = 𝐺 ↔ ((𝐹𝐴) = (𝐺𝐴) ∧ (𝐹𝐵) = (𝐺𝐵))))

Theoremfnopabco 32687* Composition of a function with a function abstraction. (Contributed by Jeff Madsen, 2-Sep-2009.) (Revised by Mario Carneiro, 27-Dec-2014.)
(𝑥𝐴𝐵𝐶)    &   𝐹 = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐵)}    &   𝐺 = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = (𝐻𝐵))}       (𝐻 Fn 𝐶𝐺 = (𝐻𝐹))

Theoremopropabco 32688* Composition of an operator with a function abstraction. (Contributed by Jeff Madsen, 11-Jun-2010.)
(𝑥𝐴𝐵𝑅)    &   (𝑥𝐴𝐶𝑆)    &   𝐹 = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = ⟨𝐵, 𝐶⟩)}    &   𝐺 = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = (𝐵𝑀𝐶))}       (𝑀 Fn (𝑅 × 𝑆) → 𝐺 = (𝑀𝐹))

Theoremf1opr 32689* Condition for an operation to be one-to-one. (Contributed by Jeff Madsen, 17-Jun-2010.)
(𝐹:(𝐴 × 𝐵)–1-1𝐶 ↔ (𝐹:(𝐴 × 𝐵)⟶𝐶 ∧ ∀𝑟𝐴𝑠𝐵𝑡𝐴𝑢𝐵 ((𝑟𝐹𝑠) = (𝑡𝐹𝑢) → (𝑟 = 𝑡𝑠 = 𝑢))))

Theoremcocnv 32690 Composition with a function and then with the converse. (Contributed by Jeff Madsen, 2-Sep-2009.)
((Fun 𝐹 ∧ Fun 𝐺) → ((𝐹𝐺) ∘ 𝐺) = (𝐹 ↾ ran 𝐺))

Theoremf1ocan1fv 32691 Cancel a composition by a bijection by preapplying the converse. (Contributed by Jeff Madsen, 2-Sep-2009.) (Proof shortened by Mario Carneiro, 27-Dec-2014.)
((Fun 𝐹𝐺:𝐴1-1-onto𝐵𝑋𝐵) → ((𝐹𝐺)‘(𝐺𝑋)) = (𝐹𝑋))

Theoremf1ocan2fv 32692 Cancel a composition by the converse of a bijection by preapplying the bijection. (Contributed by Jeff Madsen, 2-Sep-2009.)
((Fun 𝐹𝐺:𝐴1-1-onto𝐵𝑋𝐴) → ((𝐹𝐺)‘(𝐺𝑋)) = (𝐹𝑋))

Theoreminixp 32693* Intersection of Cartesian products over the same base set. (Contributed by Jeff Madsen, 2-Sep-2009.)
(X𝑥𝐴 𝐵X𝑥𝐴 𝐶) = X𝑥𝐴 (𝐵𝐶)

Theoremupixp 32694* Universal property of the indexed Cartesian product. (Contributed by Jeff Madsen, 2-Sep-2009.) (Proof shortened by Mario Carneiro, 12-Sep-2015.)
𝑋 = X𝑏𝐴 (𝐶𝑏)    &   𝑃 = (𝑤𝐴 ↦ (𝑥𝑋 ↦ (𝑥𝑤)))       ((𝐴𝑅𝐵𝑆 ∧ ∀𝑎𝐴 (𝐹𝑎):𝐵⟶(𝐶𝑎)) → ∃!(:𝐵𝑋 ∧ ∀𝑎𝐴 (𝐹𝑎) = ((𝑃𝑎) ∘ )))

Theoremabrexdom 32695* An indexed set is dominated by the indexing set. (Contributed by Jeff Madsen, 2-Sep-2009.)
(𝑦𝐴 → ∃*𝑥𝜑)       (𝐴𝑉 → {𝑥 ∣ ∃𝑦𝐴 𝜑} ≼ 𝐴)

Theoremabrexdom2 32696* An indexed set is dominated by the indexing set. (Contributed by Jeff Madsen, 2-Sep-2009.)
(𝐴𝑉 → {𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} ≼ 𝐴)

Theoremac6gf 32697* Axiom of Choice. (Contributed by Jeff Madsen, 2-Sep-2009.)
𝑦𝜓    &   (𝑦 = (𝑓𝑥) → (𝜑𝜓))       ((𝐴𝐶 ∧ ∀𝑥𝐴𝑦𝐵 𝜑) → ∃𝑓(𝑓:𝐴𝐵 ∧ ∀𝑥𝐴 𝜓))

Theoremindexa 32698* If for every element of an indexing set 𝐴 there exists a corresponding element of another set 𝐵, then there exists a subset of 𝐵 consisting only of those elements which are indexed by 𝐴. Used to avoid the Axiom of Choice in situations where only the range of the choice function is needed. (Contributed by Jeff Madsen, 2-Sep-2009.)
((𝐵𝑀 ∧ ∀𝑥𝐴𝑦𝐵 𝜑) → ∃𝑐(𝑐𝐵 ∧ ∀𝑥𝐴𝑦𝑐 𝜑 ∧ ∀𝑦𝑐𝑥𝐴 𝜑))

Theoremindexdom 32699* If for every element of an indexing set 𝐴 there exists a corresponding element of another set 𝐵, then there exists a subset of 𝐵 consisting only of those elements which are indexed by 𝐴, and which is dominated by the set 𝐴. (Contributed by Jeff Madsen, 2-Sep-2009.)
((𝐴𝑀 ∧ ∀𝑥𝐴𝑦𝐵 𝜑) → ∃𝑐((𝑐𝐴𝑐𝐵) ∧ (∀𝑥𝐴𝑦𝑐 𝜑 ∧ ∀𝑦𝑐𝑥𝐴 𝜑)))

Theoremfrinfm 32700* A subset of a well-founded set has an infimum. (Contributed by Jeff Madsen, 2-Sep-2009.)
((𝑅 Fr 𝐴 ∧ (𝐵𝐶𝐵𝐴𝐵 ≠ ∅)) → ∃𝑥𝐴 (∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧)))

Page List
Jump to page: Contents  1 1-100 2 101-200 3 201-300 4 301-400 5 401-500 6 501-600 7 601-700 8 701-800 9 801-900 10 901-1000 11 1001-1100 12 1101-1200 13 1201-1300 14 1301-1400 15 1401-1500 16 1501-1600 17 1601-1700 18 1701-1800 19 1801-1900 20 1901-2000 21 2001-2100 22 2101-2200 23 2201-2300 24 2301-2400 25 2401-2500 26 2501-2600 27 2601-2700 28 2701-2800 29 2801-2900 30 2901-3000 31 3001-3100 32 3101-3200 33 3201-3300 34 3301-3400 35 3401-3500 36 3501-3600 37 3601-3700 38 3701-3800 39 3801-3900 40 3901-4000 41 4001-4100 42 4101-4200 43 4201-4300 44 4301-4400 45 4401-4500 46 4501-4600 47 4601-4700 48 4701-4800 49 4801-4900 50 4901-5000 51 5001-5100 52 5101-5200 53 5201-5300 54 5301-5400 55 5401-5500 56 5501-5600 57 5601-5700 58 5701-5800 59 5801-5900 60 5901-6000 61 6001-6100 62 6101-6200 63 6201-6300 64 6301-6400 65 6401-6500 66 6501-6600 67 6601-6700 68 6701-6800 69 6801-6900 70 6901-7000 71 7001-7100 72 7101-7200 73 7201-7300 74 7301-7400 75 7401-7500 76 7501-7600 77 7601-7700 78 7701-7800 79 7801-7900 80 7901-8000 81 8001-8100 82 8101-8200 83 8201-8300 84 8301-8400 85 8401-8500 86 8501-8600 87 8601-8700 88 8701-8800 89 8801-8900 90 8901-9000 91 9001-9100 92 9101-9200 93 9201-9300 94 9301-9400 95 9401-9500 96 9501-9600 97 9601-9700 98 9701-9800 99 9801-9900 100 9901-10000 101 10001-10100 102 10101-10200 103 10201-10300 104 10301-10400 105 10401-10500 106 10501-10600 107 10601-10700 108 10701-10800 109 10801-10900 110 10901-11000 111 11001-11100 112 11101-11200 113 11201-11300 114 11301-11400 115 11401-11500 116 11501-11600 117 11601-11700 118 11701-11800 119 11801-11900 120 11901-12000 121 12001-12100 122 12101-12200 123 12201-12300 124 12301-12400 125 12401-12500 126 12501-12600 127 12601-12700 128 12701-12800 129 12801-12900 130 12901-13000 131 13001-13100 132 13101-13200 133 13201-13300 134 13301-13400 135 13401-13500 136 13501-13600 137 13601-13700 138 13701-13800 139 13801-13900 140 13901-14000 141 14001-14100 142 14101-14200 143 14201-14300 144 14301-14400 145 14401-14500 146 14501-14600 147 14601-14700 148 14701-14800 149 14801-14900 150 14901-15000 151 15001-15100 152 15101-15200 153 15201-15300 154 15301-15400 155 15401-15500 156 15501-15600 157 15601-15700 158 15701-15800 159 15801-15900 160 15901-16000 161 16001-16100 162 16101-16200 163 16201-16300 164 16301-16400 165 16401-16500 166 16501-16600 167 16601-16700 168 16701-16800 169 16801-16900 170 16901-17000 171 17001-17100 172 17101-17200 173 17201-17300 174 17301-17400 175 17401-17500 176 17501-17600 177 17601-17700 178 17701-17800 179 17801-17900 180 17901-18000 181 18001-18100 182 18101-18200 183 18201-18300 184 18301-18400 185 18401-18500 186 18501-18600 187 18601-18700 188 18701-18800 189 18801-18900 190 18901-19000 191 19001-19100 192 19101-19200 193 19201-19300 194 19301-19400 195 19401-19500 196 19501-19600 197 19601-19700 198 19701-19800 199 19801-19900 200 19901-20000 201 20001-20100 202 20101-20200 203 20201-20300 204 20301-20400 205 20401-20500 206 20501-20600 207 20601-20700 208 20701-20800 209 20801-20900 210 20901-21000 211 21001-21100 212 21101-21200 213 21201-21300 214 21301-21400 215 21401-21500 216 21501-21600 217 21601-21700 218 21701-21800 219 21801-21900 220 21901-22000 221 22001-22100 222 22101-22200 223 22201-22300 224 22301-22400 225 22401-22500 226 22501-22600 227 22601-22700 228 22701-22800 229 22801-22900 230 22901-23000 231 23001-23100 232 23101-23200 233 23201-23300 234 23301-23400 235 23401-23500 236 23501-23600 237 23601-23700 238 23701-23800 239 23801-23900 240 23901-24000 241 24001-24100 242 24101-24200 243 24201-24300 244 24301-24400 245 24401-24500 246 24501-24600 247 24601-24700 248 24701-24800 249 24801-24900 250 24901-25000 251 25001-25100 252 25101-25200 253 25201-25300 254 25301-25400 255 25401-25500 256 25501-25600 257 25601-25700 258 25701-25800 259 25801-25900 260 25901-26000 261 26001-26100 262 26101-26200 263 26201-26300 264 26301-26400 265 26401-26500 266 26501-26600 267 26601-26700 268 26701-26800 269 26801-26900 270 26901-27000 271 27001-27100 272 27101-27200 273 27201-27300 274 27301-27400 275 27401-27500 276 27501-27600 277 27601-27700 278 27701-27800 279 27801-27900 280 27901-28000 281 28001-28100 282 28101-28200 283 28201-28300 284 28301-28400 285 28401-28500 286 28501-28600 287 28601-28700 288 28701-28800 289 28801-28900 290 28901-29000 291 29001-29100 292 29101-29200 293 29201-29300 294 29301-29400 295 29401-29500 296 29501-29600 297 29601-29700 298 29701-29800 299 29801-29900 300 29901-30000 301 30001-30100 302 30101-30200 303 30201-30300 304 30301-30400 305 30401-30500 306 30501-30600 307 30601-30700 308 30701-30800 309 30801-30900 310 30901-31000 311 31001-31100 312 31101-31200 313 31201-31300 314 31301-31400 315 31401-31500 316 31501-31600 317 31601-31700 318 31701-31800 319 31801-31900 320 31901-32000 321 32001-32100 322 32101-32200 323 32201-32300 324 32301-32400 325 32401-32500 326 32501-32600 327 32601-32700 328 32701-32800 329 32801-32900 330 32901-33000 331 33001-33100 332 33101-33200 333 33201-33300 334 33301-33400 335 33401-33500 336 33501-33600 337 33601-33700 338 33701-33800 339 33801-33900 340 33901-34000 341 34001-34100 342 34101-34200 343 34201-34300 344 34301-34400 345 34401-34500 346 34501-34600 347 34601-34700 348 34701-34800 349 34801-34900 350 34901-35000 351 35001-35100 352 35101-35200 353 35201-35300 354 35301-35400 355 35401-35500 356 35501-35600 357 35601-35700 358 35701-35800 359 35801-35900 360 35901-36000 361 36001-36100 362 36101-36200 363 36201-36300 364 36301-36400 365 36401-36500 366 36501-36600 367 36601-36700 368 36701-36800 369 36801-36900 370 36901-37000 371 37001-37100 372 37101-37200 373 37201-37300 374 37301-37400 375 37401-37500 376 37501-37600 377 37601-37700 378 37701-37800 379 37801-37900 380 37901-38000 381 38001-38100 382 38101-38200 383 38201-38300 384 38301-38400 385 38401-38500 386 38501-38600 387 38601-38700 388 38701-38800 389 38801-38900 390 38901-39000 391 39001-39100 392 39101-39200 393 39201-39300 394 39301-39400 395 39401-39500 396 39501-39600 397 39601-39700 398 39701-39800 399 39801-39900 400 39901-40000 401 40001-40100 402 40101-40200 403 40201-40300 404 40301-40400 405 40401-40500 406 40501-40600 407 40601-40700 408 40701-40800 409 40801-40900 410 40901-41000 411 41001-41100 412 41101-41200 413 41201-41300 414 41301-41400 415 41401-41500 416 41501-41600 417 41601-41700 418 41701-41800 419 41801-41900 420 41901-42000 421 42001-42100 422 42101-42200 423 42201-42300 424 42301-42360
 Copyright terms: Public domain < Previous  Next >