Mathbox for Scott Fenton |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > frrlem16 | Structured version Visualization version GIF version |
Description: Lemma for general founded recursion. Establish a subset relationship. (Contributed by Scott Fenton, 11-Sep-2023.) |
Ref | Expression |
---|---|
frrlem16 | ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑧 ∈ 𝐴) → ∀𝑤 ∈ TrPred (𝑅, 𝐴, 𝑧)Pred(𝑅, 𝐴, 𝑤) ⊆ TrPred(𝑅, 𝐴, 𝑧)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simplr 767 | . . . 4 ⊢ ((((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑧 ∈ 𝐴) ∧ 𝑤 ∈ TrPred(𝑅, 𝐴, 𝑧)) → 𝑧 ∈ 𝐴) | |
2 | simpllr 774 | . . . 4 ⊢ ((((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑧 ∈ 𝐴) ∧ 𝑤 ∈ TrPred(𝑅, 𝐴, 𝑧)) → 𝑅 Se 𝐴) | |
3 | 1, 2 | jca 514 | . . 3 ⊢ ((((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑧 ∈ 𝐴) ∧ 𝑤 ∈ TrPred(𝑅, 𝐴, 𝑧)) → (𝑧 ∈ 𝐴 ∧ 𝑅 Se 𝐴)) |
4 | simpr 487 | . . 3 ⊢ ((((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑧 ∈ 𝐴) ∧ 𝑤 ∈ TrPred(𝑅, 𝐴, 𝑧)) → 𝑤 ∈ TrPred(𝑅, 𝐴, 𝑧)) | |
5 | trpredtr 33093 | . . 3 ⊢ ((𝑧 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → (𝑤 ∈ TrPred(𝑅, 𝐴, 𝑧) → Pred(𝑅, 𝐴, 𝑤) ⊆ TrPred(𝑅, 𝐴, 𝑧))) | |
6 | 3, 4, 5 | sylc 65 | . 2 ⊢ ((((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑧 ∈ 𝐴) ∧ 𝑤 ∈ TrPred(𝑅, 𝐴, 𝑧)) → Pred(𝑅, 𝐴, 𝑤) ⊆ TrPred(𝑅, 𝐴, 𝑧)) |
7 | 6 | ralrimiva 3181 | 1 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑧 ∈ 𝐴) → ∀𝑤 ∈ TrPred (𝑅, 𝐴, 𝑧)Pred(𝑅, 𝐴, 𝑤) ⊆ TrPred(𝑅, 𝐴, 𝑧)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∈ wcel 2113 ∀wral 3137 ⊆ wss 3933 Fr wfr 5508 Se wse 5509 Predcpred 6144 TrPredctrpred 33080 |
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 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2792 ax-rep 5187 ax-sep 5200 ax-nul 5207 ax-pow 5263 ax-pr 5327 ax-un 7458 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1083 df-3an 1084 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2799 df-cleq 2813 df-clel 2892 df-nfc 2962 df-ne 3016 df-ral 3142 df-rex 3143 df-reu 3144 df-rab 3146 df-v 3495 df-sbc 3771 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4465 df-pw 4538 df-sn 4565 df-pr 4567 df-tp 4569 df-op 4571 df-uni 4836 df-iun 4918 df-br 5064 df-opab 5126 df-mpt 5144 df-tr 5170 df-id 5457 df-eprel 5462 df-po 5471 df-so 5472 df-fr 5511 df-se 5512 df-we 5513 df-xp 5558 df-rel 5559 df-cnv 5560 df-co 5561 df-dm 5562 df-rn 5563 df-res 5564 df-ima 5565 df-pred 6145 df-ord 6191 df-on 6192 df-lim 6193 df-suc 6194 df-iota 6311 df-fun 6354 df-fn 6355 df-f 6356 df-f1 6357 df-fo 6358 df-f1o 6359 df-fv 6360 df-om 7578 df-wrecs 7944 df-recs 8005 df-rdg 8043 df-trpred 33081 |
This theorem is referenced by: frr1 33168 |
Copyright terms: Public domain | W3C validator |