Users' Mathboxes Mathbox for Jonathan Ben-Naim < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bnj607 Structured version   Visualization version   GIF version

Theorem bnj607 35546
Description: Technical lemma for bnj852 35551. This lemma may no longer be used or have become an indirect lemma of the theorem in question (i.e. a lemma of a lemma... of the theorem). (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Hypotheses
Ref Expression
bnj607.5 (𝜃 ↔ ∀𝑚 ∈ 𝐷 (𝑚 E 𝑛 → [𝑚 / 𝑛]𝜒))
bnj607.13 (𝜑″ ↔ [𝐺 / 𝑓]𝜑)
bnj607.14 (𝜓″ ↔ [𝐺 / 𝑓]𝜓)
bnj607.17 (𝜏 ↔ (𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′))
bnj607.19 (𝜂 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝))
bnj607.28 𝐺 ∈ V
bnj607.31 (𝜒′ ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′)))
bnj607.32 (𝜑″ ↔ (𝐺‘∅) = pred(𝑥, 𝐴, 𝑅))
bnj607.33 (𝜓″ ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝐺‘suc 𝑖) = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅)))
bnj607.37 ((𝑛 ≠ 1o ∧ 𝑛 ∈ 𝐷) → ∃𝑚∃𝑝𝜂)
bnj607.38 ((𝜃 ∧ 𝑚 ∈ 𝐷 ∧ 𝑚 E 𝑛) → 𝜒′)
bnj607.41 ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂) → 𝐺 Fn 𝑛)
bnj607.42 ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂) → 𝜑″)
bnj607.43 ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂) → 𝜓″)
bnj607.1 (𝜑 ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
bnj607.2 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
bnj607.400 (𝜑0 ↔ [ℎ / 𝑓]𝜑)
bnj607.401 (𝜓0 ↔ [ℎ / 𝑓]𝜓)
bnj607.300 (𝜑1 ↔ [𝐺 / ℎ]𝜑0)
bnj607.301 (𝜓1 ↔ [𝐺 / ℎ]𝜓0)
Assertion
Ref Expression
bnj607 ((𝑛 ≠ 1o ∧ 𝑛 ∈ 𝐷 ∧ 𝜃) → ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
Distinct variable groups:   𝐴,𝑓,ℎ   𝐴,𝑚,𝑓   𝐴,𝑝,𝑓   ℎ,𝐺,𝑖,𝑦   𝑅,𝑓,ℎ   𝑅,𝑚   𝑅,𝑝   𝜂,𝑓   𝑓,𝑖,𝑦   𝑓,𝑛,ℎ   𝑥,𝑓,ℎ   𝜑,ℎ   𝜓,ℎ   𝑚,𝑛   𝜑,𝑚   𝜓,𝑚   𝑥,𝑚   𝑛,𝑝   𝜑,𝑝   𝜓,𝑝   𝜃,𝑝   𝑥,𝑝
Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑓, 𝑖, 𝑛)   𝜓(𝑥, 𝑦, 𝑓, 𝑖, 𝑛)   𝜒(𝑥, 𝑦, 𝑓, ℎ, 𝑖, 𝑚, 𝑛, 𝑝)   𝜃(𝑥, 𝑦, 𝑓, ℎ, 𝑖, 𝑚, 𝑛)   𝜏(𝑥, 𝑦, 𝑓, ℎ, 𝑖, 𝑚, 𝑛, 𝑝)   𝜂(𝑥, 𝑦, ℎ, 𝑖, 𝑚, 𝑛, 𝑝)   𝐴(𝑥, 𝑦, 𝑖, 𝑛)   𝐷(𝑥, 𝑦, 𝑓, ℎ, 𝑖, 𝑚, 𝑛, 𝑝)   𝑅(𝑥, 𝑦, 𝑖, 𝑛)   𝐺(𝑥, 𝑓, 𝑚, 𝑛, 𝑝)   𝜑′(𝑥, 𝑦, 𝑓, ℎ, 𝑖, 𝑚, 𝑛, 𝑝)   𝜓′(𝑥, 𝑦, 𝑓, ℎ, 𝑖, 𝑚, 𝑛, 𝑝)   𝜒′(𝑥, 𝑦, 𝑓, ℎ, 𝑖, 𝑚, 𝑛, 𝑝)   𝜑″(𝑥, 𝑦, 𝑓, ℎ, 𝑖, 𝑚, 𝑛, 𝑝)   𝜓″(𝑥, 𝑦, 𝑓, ℎ, 𝑖, 𝑚, 𝑛, 𝑝)   𝜑0(𝑥, 𝑦, 𝑓, ℎ, 𝑖, 𝑚, 𝑛, 𝑝)   𝜓0(𝑥, 𝑦, 𝑓, ℎ, 𝑖, 𝑚, 𝑛, 𝑝)   𝜑1(𝑥, 𝑦, 𝑓, ℎ, 𝑖, 𝑚, 𝑛, 𝑝)   𝜓1(𝑥, 𝑦, 𝑓, ℎ, 𝑖, 𝑚, 𝑛, 𝑝)

Proof of Theorem bnj607
StepHypRef Expression
1 bnj607.37 . . . . 5 ((𝑛 ≠ 1o ∧ 𝑛 ∈ 𝐷) → ∃𝑚∃𝑝𝜂)
21anim1i 627 . . . 4 (((𝑛 ≠ 1o ∧ 𝑛 ∈ 𝐷) ∧ 𝜃) → (∃𝑚∃𝑝𝜂 ∧ 𝜃))
3 nfv 1946 . . . . . . 7 Ⅎ𝑝𝜃
4319.41 2271 . . . . . 6 (∃𝑝(𝜂 ∧ 𝜃) ↔ (∃𝑝𝜂 ∧ 𝜃))
54exbii 1880 . . . . 5 (∃𝑚∃𝑝(𝜂 ∧ 𝜃) ↔ ∃𝑚(∃𝑝𝜂 ∧ 𝜃))
6 bnj607.5 . . . . . . . 8 (𝜃 ↔ ∀𝑚 ∈ 𝐷 (𝑚 E 𝑛 → [𝑚 / 𝑛]𝜒))
76bnj1095 35412 . . . . . . 7 (𝜃 → ∀𝑚𝜃)
87nf5i 2182 . . . . . 6 Ⅎ𝑚𝜃
9819.41 2271 . . . . 5 (∃𝑚(∃𝑝𝜂 ∧ 𝜃) ↔ (∃𝑚∃𝑝𝜂 ∧ 𝜃))
105, 9bitr2i 279 . . . 4 ((∃𝑚∃𝑝𝜂 ∧ 𝜃) ↔ ∃𝑚∃𝑝(𝜂 ∧ 𝜃))
112, 10sylib 221 . . 3 (((𝑛 ≠ 1o ∧ 𝑛 ∈ 𝐷) ∧ 𝜃) → ∃𝑚∃𝑝(𝜂 ∧ 𝜃))
12 bnj607.19 . . . . . . . . . 10 (𝜂 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝))
1312bnj1232 35433 . . . . . . . . 9 (𝜂 → 𝑚 ∈ 𝐷)
14 bnj219 35364 . . . . . . . . . 10 (𝑛 = suc 𝑚 → 𝑚 E 𝑛)
1512, 14bnj770 35394 . . . . . . . . 9 (𝜂 → 𝑚 E 𝑛)
1613, 15jca 521 . . . . . . . 8 (𝜂 → (𝑚 ∈ 𝐷 ∧ 𝑚 E 𝑛))
1716anim1i 627 . . . . . . 7 ((𝜂 ∧ 𝜃) → ((𝑚 ∈ 𝐷 ∧ 𝑚 E 𝑛) ∧ 𝜃))
18 bnj170 35329 . . . . . . 7 ((𝜃 ∧ 𝑚 ∈ 𝐷 ∧ 𝑚 E 𝑛) ↔ ((𝑚 ∈ 𝐷 ∧ 𝑚 E 𝑛) ∧ 𝜃))
1917, 18sylibr 237 . . . . . 6 ((𝜂 ∧ 𝜃) → (𝜃 ∧ 𝑚 ∈ 𝐷 ∧ 𝑚 E 𝑛))
20 bnj607.38 . . . . . 6 ((𝜃 ∧ 𝑚 ∈ 𝐷 ∧ 𝑚 E 𝑛) → 𝜒′)
2119, 20syl 18 . . . . 5 ((𝜂 ∧ 𝜃) → 𝜒′)
22 simpl 488 . . . . 5 ((𝜂 ∧ 𝜃) → 𝜂)
2321, 22jca 521 . . . 4 ((𝜂 ∧ 𝜃) → (𝜒′ ∧ 𝜂))
24232eximi 1868 . . 3 (∃𝑚∃𝑝(𝜂 ∧ 𝜃) → ∃𝑚∃𝑝(𝜒′ ∧ 𝜂))
25 bnj607.31 . . . . . . . . . . . 12 (𝜒′ ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′)))
2625biimpi 219 . . . . . . . . . . 11 (𝜒′ → ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′)))
27 euex 2602 . . . . . . . . . . 11 (∃!𝑓(𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′) → ∃𝑓(𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′))
2826, 27syl6 36 . . . . . . . . . 10 (𝜒′ → ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃𝑓(𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′)))
2928impcom 413 . . . . . . . . 9 (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ 𝜒′) → ∃𝑓(𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′))
30 bnj607.17 . . . . . . . . 9 (𝜏 ↔ (𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′))
3129, 30bnj1198 35425 . . . . . . . 8 (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ 𝜒′) → ∃𝑓𝜏)
3231adantrr 730 . . . . . . 7 (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝜒′ ∧ 𝜂)) → ∃𝑓𝜏)
33 id 23 . . . . . . . . . . 11 ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂) → (𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂))
34333com23 1144 . . . . . . . . . 10 ((𝑅 FrSe 𝐴 ∧ 𝜂 ∧ 𝜏) → (𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂))
35343expia 1139 . . . . . . . . 9 ((𝑅 FrSe 𝐴 ∧ 𝜂) → (𝜏 → (𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂)))
3635eximdv 1949 . . . . . . . 8 ((𝑅 FrSe 𝐴 ∧ 𝜂) → (∃𝑓𝜏 → ∃𝑓(𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂)))
3736ad2ant2rl 762 . . . . . . 7 (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝜒′ ∧ 𝜂)) → (∃𝑓𝜏 → ∃𝑓(𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂)))
3832, 37mpd 16 . . . . . 6 (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝜒′ ∧ 𝜂)) → ∃𝑓(𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂))
39 bnj607.41 . . . . . . . 8 ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂) → 𝐺 Fn 𝑛)
40 bnj607.42 . . . . . . . 8 ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂) → 𝜑″)
41 bnj607.43 . . . . . . . 8 ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂) → 𝜓″)
4239, 40, 413jca 1146 . . . . . . 7 ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂) → (𝐺 Fn 𝑛 ∧ 𝜑″ ∧ 𝜓″))
4342eximi 1867 . . . . . 6 (∃𝑓(𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂) → ∃𝑓(𝐺 Fn 𝑛 ∧ 𝜑″ ∧ 𝜓″))
44 nfe1 2186 . . . . . . 7 Ⅎ𝑓∃𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)
45 bnj607.28 . . . . . . . . 9 𝐺 ∈ V
46 nfcv 2922 . . . . . . . . . 10 Ⅎℎ𝐺
47 nfv 1946 . . . . . . . . . . 11 Ⅎℎ 𝐺 Fn 𝑛
48 bnj607.300 . . . . . . . . . . . 12 (𝜑1 ↔ [𝐺 / ℎ]𝜑0)
49 nfsbc1v 3758 . . . . . . . . . . . 12 Ⅎℎ[𝐺 / ℎ]𝜑0
5048, 49nfxfr 1885 . . . . . . . . . . 11 Ⅎℎ𝜑1
51 bnj607.301 . . . . . . . . . . . 12 (𝜓1 ↔ [𝐺 / ℎ]𝜓0)
52 nfsbc1v 3758 . . . . . . . . . . . 12 Ⅎℎ[𝐺 / ℎ]𝜓0
5351, 52nfxfr 1885 . . . . . . . . . . 11 Ⅎℎ𝜓1
5447, 50, 53nf3an 1933 . . . . . . . . . 10 Ⅎℎ(𝐺 Fn 𝑛 ∧ 𝜑1 ∧ 𝜓1)
55 fneq1 6630 . . . . . . . . . . 11 (ℎ = 𝐺 → (ℎ Fn 𝑛 ↔ 𝐺 Fn 𝑛))
56 sbceq1a 3749 . . . . . . . . . . . 12 (ℎ = 𝐺 → (𝜑0 ↔ [𝐺 / ℎ]𝜑0))
5756, 48bitr4di 292 . . . . . . . . . . 11 (ℎ = 𝐺 → (𝜑0 ↔ 𝜑1))
58 sbceq1a 3749 . . . . . . . . . . . 12 (ℎ = 𝐺 → (𝜓0 ↔ [𝐺 / ℎ]𝜓0))
5958, 51bitr4di 292 . . . . . . . . . . 11 (ℎ = 𝐺 → (𝜓0 ↔ 𝜓1))
6055, 57, 593anbi123d 1464 . . . . . . . . . 10 (ℎ = 𝐺 → ((ℎ Fn 𝑛 ∧ 𝜑0 ∧ 𝜓0) ↔ (𝐺 Fn 𝑛 ∧ 𝜑1 ∧ 𝜓1)))
6146, 54, 60spcegf 3546 . . . . . . . . 9 (𝐺 ∈ V → ((𝐺 Fn 𝑛 ∧ 𝜑1 ∧ 𝜓1) → ∃ℎ(ℎ Fn 𝑛 ∧ 𝜑0 ∧ 𝜓0)))
6245, 61ax-mp 5 . . . . . . . 8 ((𝐺 Fn 𝑛 ∧ 𝜑1 ∧ 𝜓1) → ∃ℎ(ℎ Fn 𝑛 ∧ 𝜑0 ∧ 𝜓0))
63 bnj607.32 . . . . . . . . . . . 12 (𝜑″ ↔ (𝐺‘∅) = pred(𝑥, 𝐴, 𝑅))
64 bnj607.400 . . . . . . . . . . . . . 14 (𝜑0 ↔ [ℎ / 𝑓]𝜑)
65 bnj607.1 . . . . . . . . . . . . . 14 (𝜑 ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
6664, 65bnj154 35508 . . . . . . . . . . . . 13 (𝜑0 ↔ (ℎ‘∅) = pred(𝑥, 𝐴, 𝑅))
6766, 48, 45bnj526 35518 . . . . . . . . . . . 12 (𝜑1 ↔ (𝐺‘∅) = pred(𝑥, 𝐴, 𝑅))
6863, 67bitr4i 281 . . . . . . . . . . 11 (𝜑″ ↔ 𝜑1)
69 bnj607.33 . . . . . . . . . . . 12 (𝜓″ ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝐺‘suc 𝑖) = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅)))
70 bnj607.2 . . . . . . . . . . . . . 14 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
71 bnj607.401 . . . . . . . . . . . . . 14 (𝜓0 ↔ [ℎ / 𝑓]𝜓)
72 vex 3454 . . . . . . . . . . . . . 14 ℎ ∈ V
7370, 71, 72bnj540 35522 . . . . . . . . . . . . 13 (𝜓0 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (ℎ‘suc 𝑖) = ∪ 𝑦 ∈ (ℎ‘𝑖) pred(𝑦, 𝐴, 𝑅)))
7473, 51, 45bnj540 35522 . . . . . . . . . . . 12 (𝜓1 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝐺‘suc 𝑖) = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅)))
7569, 74bitr4i 281 . . . . . . . . . . 11 (𝜓″ ↔ 𝜓1)
7668, 75anbi12i 640 . . . . . . . . . 10 ((𝜑″ ∧ 𝜓″) ↔ (𝜑1 ∧ 𝜓1))
7776anbi2i 635 . . . . . . . . 9 ((𝐺 Fn 𝑛 ∧ (𝜑″ ∧ 𝜓″)) ↔ (𝐺 Fn 𝑛 ∧ (𝜑1 ∧ 𝜓1)))
78 3anass 1111 . . . . . . . . 9 ((𝐺 Fn 𝑛 ∧ 𝜑″ ∧ 𝜓″) ↔ (𝐺 Fn 𝑛 ∧ (𝜑″ ∧ 𝜓″)))
79 3anass 1111 . . . . . . . . 9 ((𝐺 Fn 𝑛 ∧ 𝜑1 ∧ 𝜓1) ↔ (𝐺 Fn 𝑛 ∧ (𝜑1 ∧ 𝜓1)))
8077, 78, 793bitr4i 306 . . . . . . . 8 ((𝐺 Fn 𝑛 ∧ 𝜑″ ∧ 𝜓″) ↔ (𝐺 Fn 𝑛 ∧ 𝜑1 ∧ 𝜓1))
81 nfv 1946 . . . . . . . . 9 Ⅎℎ(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)
82 nfv 1946 . . . . . . . . . 10 Ⅎ𝑓 ℎ Fn 𝑛
83 nfsbc1v 3758 . . . . . . . . . . 11 Ⅎ𝑓[ℎ / 𝑓]𝜑
8464, 83nfxfr 1885 . . . . . . . . . 10 Ⅎ𝑓𝜑0
85 nfsbc1v 3758 . . . . . . . . . . 11 Ⅎ𝑓[ℎ / 𝑓]𝜓
8671, 85nfxfr 1885 . . . . . . . . . 10 Ⅎ𝑓𝜓0
8782, 84, 86nf3an 1933 . . . . . . . . 9 Ⅎ𝑓(ℎ Fn 𝑛 ∧ 𝜑0 ∧ 𝜓0)
88 fneq1 6630 . . . . . . . . . 10 (𝑓 = ℎ → (𝑓 Fn 𝑛 ↔ ℎ Fn 𝑛))
89 sbceq1a 3749 . . . . . . . . . . 11 (𝑓 = ℎ → (𝜑 ↔ [ℎ / 𝑓]𝜑))
9089, 64bitr4di 292 . . . . . . . . . 10 (𝑓 = ℎ → (𝜑 ↔ 𝜑0))
91 sbceq1a 3749 . . . . . . . . . . 11 (𝑓 = ℎ → (𝜓 ↔ [ℎ / 𝑓]𝜓))
9291, 71bitr4di 292 . . . . . . . . . 10 (𝑓 = ℎ → (𝜓 ↔ 𝜓0))
9388, 90, 923anbi123d 1464 . . . . . . . . 9 (𝑓 = ℎ → ((𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ (ℎ Fn 𝑛 ∧ 𝜑0 ∧ 𝜓0)))
9481, 87, 93cbvexv1 2371 . . . . . . . 8 (∃𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ ∃ℎ(ℎ Fn 𝑛 ∧ 𝜑0 ∧ 𝜓0))
9562, 80, 943imtr4i 295 . . . . . . 7 ((𝐺 Fn 𝑛 ∧ 𝜑″ ∧ 𝜓″) → ∃𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
9644, 95exlimi 2253 . . . . . 6 (∃𝑓(𝐺 Fn 𝑛 ∧ 𝜑″ ∧ 𝜓″) → ∃𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
9738, 43, 963syl 19 . . . . 5 (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝜒′ ∧ 𝜂)) → ∃𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
9897expcom 419 . . . 4 ((𝜒′ ∧ 𝜂) → ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
9998exlimivv 1964 . . 3 (∃𝑚∃𝑝(𝜒′ ∧ 𝜂) → ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
10011, 24, 993syl 19 . 2 (((𝑛 ≠ 1o ∧ 𝑛 ∈ 𝐷) ∧ 𝜃) → ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
1011003impa 1127 1 ((𝑛 ≠ 1o ∧ 𝑛 ∈ 𝐷 ∧ 𝜃) → ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569  ∃wex 1811   ∈ wcel 2144  ∃!weu 2593   ≠ wne 2955  ∀wral 3076  Vcvv 3450  [wsbc 3738  ∅c0 4278  ∪ ciun 4950   class class class wbr 5102   E cep 5549  suc csuc 6364   Fn wfn 6533  ‘cfv 6538  ωcom 7877  1oc1o 8469   ∧ w-bnj17 35317   predc-bnj14 35319   FrSe w-bnj15 35323
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-eprel 5550  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-fv 6546  df-bnj17 35318
This theorem is used by:  bnj600  35549
  Copyright terms: Public domain W3C validator