Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nfdisj | Structured version Visualization version GIF version |
Description: Bound-variable hypothesis builder for disjoint collection. (Contributed by Mario Carneiro, 14-Nov-2016.) |
Ref | Expression |
---|---|
nfdisj.1 | ⊢ Ⅎ𝑦𝐴 |
nfdisj.2 | ⊢ Ⅎ𝑦𝐵 |
Ref | Expression |
---|---|
nfdisj | ⊢ Ⅎ𝑦Disj 𝑥 ∈ 𝐴 𝐵 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfdisj2 4555 | . 2 ⊢ (Disj 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑧∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵)) | |
2 | nftru 1721 | . . . . 5 ⊢ Ⅎ𝑥⊤ | |
3 | nfcvf 2774 | . . . . . . . 8 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → Ⅎ𝑦𝑥) | |
4 | nfdisj.1 | . . . . . . . . 9 ⊢ Ⅎ𝑦𝐴 | |
5 | 4 | a1i 11 | . . . . . . . 8 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → Ⅎ𝑦𝐴) |
6 | 3, 5 | nfeld 2759 | . . . . . . 7 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → Ⅎ𝑦 𝑥 ∈ 𝐴) |
7 | nfdisj.2 | . . . . . . . . 9 ⊢ Ⅎ𝑦𝐵 | |
8 | 7 | nfcri 2745 | . . . . . . . 8 ⊢ Ⅎ𝑦 𝑧 ∈ 𝐵 |
9 | 8 | a1i 11 | . . . . . . 7 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → Ⅎ𝑦 𝑧 ∈ 𝐵) |
10 | 6, 9 | nfand 1814 | . . . . . 6 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → Ⅎ𝑦(𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵)) |
11 | 10 | adantl 481 | . . . . 5 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦(𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵)) |
12 | 2, 11 | nfmod2 2471 | . . . 4 ⊢ (⊤ → Ⅎ𝑦∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵)) |
13 | 12 | trud 1484 | . . 3 ⊢ Ⅎ𝑦∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵) |
14 | 13 | nfal 2139 | . 2 ⊢ Ⅎ𝑦∀𝑧∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵) |
15 | 1, 14 | nfxfr 1771 | 1 ⊢ Ⅎ𝑦Disj 𝑥 ∈ 𝐴 𝐵 |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ∧ wa 383 ∀wal 1473 ⊤wtru 1476 Ⅎwnf 1699 ∈ wcel 1977 ∃*wmo 2459 Ⅎwnfc 2738 Disj wdisj 4553 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-cleq 2603 df-clel 2606 df-nfc 2740 df-rmo 2904 df-disj 4554 |
This theorem is referenced by: disjxiun 4579 disjxiunOLD 4580 |
Copyright terms: Public domain | W3C validator |