Mathbox for Scott Fenton |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > trpredelss | Structured version Visualization version GIF version |
Description: Given a transitive predecessor 𝑌 of 𝑋, the transitive predecessors of 𝑌 are a subset of the transitive predecessors of 𝑋. (Contributed by Scott Fenton, 25-Apr-2012.) (Revised by Mario Carneiro, 26-Jun-2015.) |
Ref | Expression |
---|---|
trpredelss | ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → (𝑌 ∈ TrPred(𝑅, 𝐴, 𝑋) → TrPred(𝑅, 𝐴, 𝑌) ⊆ TrPred(𝑅, 𝐴, 𝑋))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | setlikespec 6162 | . . . . 5 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → Pred(𝑅, 𝐴, 𝑋) ∈ V) | |
2 | trpredss 32965 | . . . . 5 ⊢ (Pred(𝑅, 𝐴, 𝑋) ∈ V → TrPred(𝑅, 𝐴, 𝑋) ⊆ 𝐴) | |
3 | 1, 2 | syl 17 | . . . 4 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → TrPred(𝑅, 𝐴, 𝑋) ⊆ 𝐴) |
4 | 3 | sselda 3964 | . . 3 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑌 ∈ TrPred(𝑅, 𝐴, 𝑋)) → 𝑌 ∈ 𝐴) |
5 | simplr 765 | . . 3 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑌 ∈ TrPred(𝑅, 𝐴, 𝑋)) → 𝑅 Se 𝐴) | |
6 | trpredtr 32966 | . . . . 5 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → (𝑦 ∈ TrPred(𝑅, 𝐴, 𝑋) → Pred(𝑅, 𝐴, 𝑦) ⊆ TrPred(𝑅, 𝐴, 𝑋))) | |
7 | 6 | ralrimiv 3178 | . . . 4 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → ∀𝑦 ∈ TrPred (𝑅, 𝐴, 𝑋)Pred(𝑅, 𝐴, 𝑦) ⊆ TrPred(𝑅, 𝐴, 𝑋)) |
8 | 7 | adantr 481 | . . 3 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑌 ∈ TrPred(𝑅, 𝐴, 𝑋)) → ∀𝑦 ∈ TrPred (𝑅, 𝐴, 𝑋)Pred(𝑅, 𝐴, 𝑦) ⊆ TrPred(𝑅, 𝐴, 𝑋)) |
9 | trpredtr 32966 | . . . 4 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → (𝑌 ∈ TrPred(𝑅, 𝐴, 𝑋) → Pred(𝑅, 𝐴, 𝑌) ⊆ TrPred(𝑅, 𝐴, 𝑋))) | |
10 | 9 | imp 407 | . . 3 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑌 ∈ TrPred(𝑅, 𝐴, 𝑋)) → Pred(𝑅, 𝐴, 𝑌) ⊆ TrPred(𝑅, 𝐴, 𝑋)) |
11 | trpredmintr 32967 | . . 3 ⊢ (((𝑌 ∈ 𝐴 ∧ 𝑅 Se 𝐴) ∧ (∀𝑦 ∈ TrPred (𝑅, 𝐴, 𝑋)Pred(𝑅, 𝐴, 𝑦) ⊆ TrPred(𝑅, 𝐴, 𝑋) ∧ Pred(𝑅, 𝐴, 𝑌) ⊆ TrPred(𝑅, 𝐴, 𝑋))) → TrPred(𝑅, 𝐴, 𝑌) ⊆ TrPred(𝑅, 𝐴, 𝑋)) | |
12 | 4, 5, 8, 10, 11 | syl22anc 834 | . 2 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑌 ∈ TrPred(𝑅, 𝐴, 𝑋)) → TrPred(𝑅, 𝐴, 𝑌) ⊆ TrPred(𝑅, 𝐴, 𝑋)) |
13 | 12 | ex 413 | 1 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → (𝑌 ∈ TrPred(𝑅, 𝐴, 𝑋) → TrPred(𝑅, 𝐴, 𝑌) ⊆ TrPred(𝑅, 𝐴, 𝑋))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∈ wcel 2105 ∀wral 3135 Vcvv 3492 ⊆ wss 3933 Se wse 5505 Predcpred 6140 TrPredctrpred 32953 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-rep 5181 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-ral 3140 df-rex 3141 df-reu 3142 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4831 df-iun 4912 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-se 5508 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-om 7570 df-wrecs 7936 df-recs 7997 df-rdg 8035 df-trpred 32954 |
This theorem is referenced by: dftrpred3g 32969 |
Copyright terms: Public domain | W3C validator |