![]() |
Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj1018g | Structured version Visualization version GIF version |
Description: Version of bnj1018 34273 with less disjoint variable conditions, but requiring ax-13 2369. (Contributed by Gino Giotto, 27-Mar-2024.) (New usage is discouraged.) |
Ref | Expression |
---|---|
bnj1018.1 | ⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)) |
bnj1018.2 | ⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))) |
bnj1018.3 | ⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) |
bnj1018.4 | ⊢ (𝜃 ↔ (𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) ∧ 𝑧 ∈ pred(𝑦, 𝐴, 𝑅))) |
bnj1018.5 | ⊢ (𝜏 ↔ (𝑚 ∈ ω ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛)) |
bnj1018.7 | ⊢ (𝜑′ ↔ [𝑝 / 𝑛]𝜑) |
bnj1018.8 | ⊢ (𝜓′ ↔ [𝑝 / 𝑛]𝜓) |
bnj1018.9 | ⊢ (𝜒′ ↔ [𝑝 / 𝑛]𝜒) |
bnj1018.10 | ⊢ (𝜑″ ↔ [𝐺 / 𝑓]𝜑′) |
bnj1018.11 | ⊢ (𝜓″ ↔ [𝐺 / 𝑓]𝜓′) |
bnj1018.12 | ⊢ (𝜒″ ↔ [𝐺 / 𝑓]𝜒′) |
bnj1018.13 | ⊢ 𝐷 = (ω ∖ {∅}) |
bnj1018.14 | ⊢ 𝐵 = {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)} |
bnj1018.15 | ⊢ 𝐶 = ∪ 𝑦 ∈ (𝑓‘𝑚) pred(𝑦, 𝐴, 𝑅) |
bnj1018.16 | ⊢ 𝐺 = (𝑓 ∪ {⟨𝑛, 𝐶⟩}) |
bnj1018.26 | ⊢ (𝜒″ ↔ (𝑝 ∈ 𝐷 ∧ 𝐺 Fn 𝑝 ∧ 𝜑″ ∧ 𝜓″)) |
bnj1018.29 | ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → 𝜒″) |
bnj1018.30 | ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → (𝜒″ ∧ 𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝)) |
Ref | Expression |
---|---|
bnj1018g | ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜂 ∧ ∃𝑝𝜏) → (𝐺‘suc 𝑖) ⊆ trCl(𝑋, 𝐴, 𝑅)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-bnj17 33996 | . . 3 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜂 ∧ ∃𝑝𝜏) ↔ ((𝜃 ∧ 𝜒 ∧ 𝜂) ∧ ∃𝑝𝜏)) | |
2 | bnj258 34017 | . . . . . . . 8 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) ↔ ((𝜃 ∧ 𝜒 ∧ 𝜂) ∧ 𝜏)) | |
3 | bnj1018.29 | . . . . . . . 8 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → 𝜒″) | |
4 | 2, 3 | sylbir 234 | . . . . . . 7 ⊢ (((𝜃 ∧ 𝜒 ∧ 𝜂) ∧ 𝜏) → 𝜒″) |
5 | 4 | ex 411 | . . . . . 6 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜂) → (𝜏 → 𝜒″)) |
6 | 5 | eximdv 1918 | . . . . 5 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜂) → (∃𝑝𝜏 → ∃𝑝𝜒″)) |
7 | bnj1018.3 | . . . . . 6 ⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) | |
8 | bnj1018.9 | . . . . . 6 ⊢ (𝜒′ ↔ [𝑝 / 𝑛]𝜒) | |
9 | bnj1018.12 | . . . . . 6 ⊢ (𝜒″ ↔ [𝐺 / 𝑓]𝜒′) | |
10 | bnj1018.14 | . . . . . 6 ⊢ 𝐵 = {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)} | |
11 | bnj1018.16 | . . . . . 6 ⊢ 𝐺 = (𝑓 ∪ {⟨𝑛, 𝐶⟩}) | |
12 | 7, 8, 9, 10, 11 | bnj985 34263 | . . . . 5 ⊢ (𝐺 ∈ 𝐵 ↔ ∃𝑝𝜒″) |
13 | 6, 12 | imbitrrdi 251 | . . . 4 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜂) → (∃𝑝𝜏 → 𝐺 ∈ 𝐵)) |
14 | 13 | imp 405 | . . 3 ⊢ (((𝜃 ∧ 𝜒 ∧ 𝜂) ∧ ∃𝑝𝜏) → 𝐺 ∈ 𝐵) |
15 | 1, 14 | sylbi 216 | . 2 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜂 ∧ ∃𝑝𝜏) → 𝐺 ∈ 𝐵) |
16 | bnj1019 34088 | . . 3 ⊢ (∃𝑝(𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) ↔ (𝜃 ∧ 𝜒 ∧ 𝜂 ∧ ∃𝑝𝜏)) | |
17 | bnj1018.30 | . . . . . 6 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → (𝜒″ ∧ 𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝)) | |
18 | 17 | simp3d 1142 | . . . . 5 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → suc 𝑖 ∈ 𝑝) |
19 | bnj1018.26 | . . . . . . 7 ⊢ (𝜒″ ↔ (𝑝 ∈ 𝐷 ∧ 𝐺 Fn 𝑝 ∧ 𝜑″ ∧ 𝜓″)) | |
20 | 19 | bnj1235 34113 | . . . . . 6 ⊢ (𝜒″ → 𝐺 Fn 𝑝) |
21 | fndm 6651 | . . . . . 6 ⊢ (𝐺 Fn 𝑝 → dom 𝐺 = 𝑝) | |
22 | 3, 20, 21 | 3syl 18 | . . . . 5 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → dom 𝐺 = 𝑝) |
23 | 18, 22 | eleqtrrd 2834 | . . . 4 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → suc 𝑖 ∈ dom 𝐺) |
24 | 23 | exlimiv 1931 | . . 3 ⊢ (∃𝑝(𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → suc 𝑖 ∈ dom 𝐺) |
25 | 16, 24 | sylbir 234 | . 2 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜂 ∧ ∃𝑝𝜏) → suc 𝑖 ∈ dom 𝐺) |
26 | bnj1018.1 | . . 3 ⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)) | |
27 | bnj1018.2 | . . 3 ⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))) | |
28 | bnj1018.13 | . . 3 ⊢ 𝐷 = (ω ∖ {∅}) | |
29 | 11 | bnj918 34075 | . . 3 ⊢ 𝐺 ∈ V |
30 | vex 3476 | . . . 4 ⊢ 𝑖 ∈ V | |
31 | 30 | sucex 7796 | . . 3 ⊢ suc 𝑖 ∈ V |
32 | 26, 27, 28, 10, 29, 31 | bnj1015 34271 | . 2 ⊢ ((𝐺 ∈ 𝐵 ∧ suc 𝑖 ∈ dom 𝐺) → (𝐺‘suc 𝑖) ⊆ trCl(𝑋, 𝐴, 𝑅)) |
33 | 15, 25, 32 | syl2anc 582 | 1 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜂 ∧ ∃𝑝𝜏) → (𝐺‘suc 𝑖) ⊆ trCl(𝑋, 𝐴, 𝑅)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 ∧ w3a 1085 = wceq 1539 ∃wex 1779 ∈ wcel 2104 {cab 2707 ∀wral 3059 ∃wrex 3068 Vcvv 3472 [wsbc 3776 ∖ cdif 3944 ∪ cun 3945 ⊆ wss 3947 ∅c0 4321 {csn 4627 ⟨cop 4633 ∪ ciun 4996 dom cdm 5675 suc csuc 6365 Fn wfn 6537 ‘cfv 6542 ωcom 7857 ∧ w-bnj17 33995 predc-bnj14 33997 FrSe w-bnj15 34001 trClc-bnj18 34003 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-13 2369 ax-ext 2701 ax-sep 5298 ax-nul 5305 ax-pr 5426 ax-un 7727 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-clab 2708 df-cleq 2722 df-clel 2808 df-nfc 2883 df-ral 3060 df-rex 3069 df-rab 3431 df-v 3474 df-sbc 3777 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4322 df-if 4528 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-iun 4998 df-br 5148 df-dm 5685 df-suc 6369 df-iota 6494 df-fn 6545 df-fv 6550 df-bnj17 33996 df-bnj18 34004 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |